In this article we explore the limiting behavior of the universal prior distribution obtained when applied over multiple meta-level hierarchy of programs and output data of a computational automata model. We were motivated to alleviate the effect of Solomonoff's assumption that all computable functions or hypotheses of the same length are equally likely, by weighing each program in turn by the algorithmic probability of their description number encoding. In the limiting case, the set of all possible program strings of a fixed-length converges to a distribution of self-replicating quines and quine-relays - having the structure of a constructor. We discuss how experimental algorithmic information theory provides insights towards understanding the fundamental metrics proposed in this work and reflect on the significance of these result in digital physics and the constructor theory of life.

Evolution by natural selection is often viewed as an optimisation process where an organism's phenotypic traits are adapted gradually to improve its fitness. Because of the many different traits with potentially conflicting requirements, among other factors, this optimisation process may appear onerous. Building on recent mathematical work connecting optima and simplicity, we here show that for certain generic phenotype fitness requirements --- those based on physics and engineering principles --- optimal phenotypic shapes will tend to `simple', in the sense of low algorithmic or descriptional complexity. As a result, we argue that adapting to these types of generic fitness requirements will be a much `easier' task for natural selection, compared to a null expectation based on arbitrary optimisation requirements. Further, selection's task may be easier still due to the fact that optimal phenotypes for one set of generic fitness constraints may also be close to optimal for other generic constraints, such that adapting to one constraint yields the other `for free'.

Developing new ways to estimate probabilities can be valuable for science, statistics, and engineering. By considering the information content of different output patterns, recent work invoking algorithmic information theory has shown that a priori probability predictions based on pattern complexities can be made in a broad class of input-output maps. These algorithmic probability predictions do not depend on a detailed knowledge of how output patterns were produced, or historical statistical data. Although quantitatively fairly accurate, a main weakness of these predictions is that they are given as an upper bound on the probability of a pattern, but many low complexity, low probability patterns occur, for which the upper bound has little predictive value. Here we study this low complexity, low probability phenomenon by looking at example maps, namely a finite state transducer, natural time series data, RNA molecule structures, and polynomial curves. Some mechanisms causing low complexity, low probability behaviour are identified, and we argue this behaviour should be assumed as a default in the real world algorithmic probability studies. Additionally, we examine some applications of algorithmic probability and discuss some implications of low complexity, low probability patterns for several research areas including simplicity in physics and biology, a priori probability predictions, Solomonoff induction and Occam's razor, machine learning, and password guessing.

With the increasing number of connected devices, complex systems such as smart homes record a multitude of events of various types, magnitude and characteristics. Current systems struggle to identify which events can be considered more memorable than others. In contrast, human are able to quickly categorize some events as being more “memorable” than others. They do so without relying on knowledge of the system’s inner working or large previous datasets. Having this ability would allow the system to: i) identify and summarize a situation to the user by presenting only memorable events; ii) suggest the most memorable events as possible hypotheses in an abductive inference process. Our proposal is to use Algorithmic Information Theory to define a “memorability” score by retrieving events using predicative filters. We use smart-home examples to illustrate how our theoretical approach can be implemented in practice.

Previous work has shown that perturbation analysis in algorithmic information dynamics can uncover generative causal processes of finite objects and quantify each of its element's information contribution to computably constructing the objects. One of the challenges for defining emergence is that the dependency on the observer's previous knowledge may cause a phenomenon to present itself as emergent for one observer at the same time that reducible for another observer. Thus, in order to quantify emergence of algorithmic information in computable generative processes, perturbation analyses may inherit such a problem of the dependency on the observer's previous formal knowledge. In this sense, by formalizing the act of observing as mutual perturbations, the emergence of algorithmic information becomes invariant, minimal, and robust to information costs and distortions, while it indeed depends on the observer. Then, we demonstrate that the unbounded increase of emergent algorithmic information implies asymptotically observer-independent emergence, which eventually overcomes any formal theory that any observer might devise. In addition, we discuss weak and strong emergence and analyze the concepts of observer-dependent emergence and asymptotically observer-independent emergence found in previous definitions and models in the literature of deterministic dynamical and computable systems.

This study examines the role of using algorithmic HRM to make strategic decisions pertaining to HR activities in organizations. The study develops a scale to measure algorithmic HRM usage in its first phase, and in the second phase, it finds that algorithmic HRM having significant impact on the strategic HR decision making that helps and enables organization in creating the competitive advantage. Utilizing the author’s LinkedIn profile, 234 final participants considered for this research. Collected data analyzed by applying PLS SEM. It evaluates the mediation role of the HR strategic decision making, and the HR digital maturity as a moderator in seeing the impact of algorithmic HRM on the competitive advantage of the firm. The study finds a strong relationship between the algorithmic HRM usage and competitive advantage, a significant relationship between algorithmic HRM usage and the strategic HR decision making, and lastly, a significant relationship between strategic HR decision making and the competitive advantage. The moderating role of HR digital maturity was found to be insignificant in this research which paves the way for further research. This research, the model, and its findings contribute to the theory and implicate the practicality of algorithmic HRM. It's one of few papers that address the algorithmic HRM usage in the transitioning economy like Saudi Arabia.

It is impossible to fully grasp reality and the universe without a sound understanding of quantum science, i.e. theory. The aim of this paper is twofold, namely first presenting what quantum information processing consists of, and then consequently discussing the implications of quantum science to the understanding of reality. I shall claim that the world is fully quantum, and the classical world is but a limit case of the quantum world. The crux of the argument is that quantum information can be taken as a living phenomenon. Quantum information processing (QIP) has been mainly the subject of computational approaches (Cooper and Hodges, 2016). Here we take it as the way in which information allows for a non-dualistic explanation of the world. In this sense, quantum information processing consists in understanding how entanglement stands as the ground for a coherent reality yet highly dynamical, vibrant and vivid. Information, I argue, is a living phenomenon that creates itself out of nothing. Quantum information is a relational view of entities, systems, phenomena, and events (Auletta, 2005).

This paper investigates a range of popular differential evolution (DE) configurations to identify components responsible for emergence of structural bias – a recently identified tendency of algorithms to prefer some regions of search space over others, for reasons unrelated to objective function values. Previous work has explored this tendency for genetic algorithms (GA) and particle swarm optimisation (PSO), finding a relationship between population size and extent of structural bias, hence highlighting potential weaknesses of those algorithms. In current article, we focus on DE, extend the investigation to include consideration of an algorithmic component that is often overlooked – constraint handling mechanism. Towards this end, a wide range of DE configurations was tested here. Results suggest that DE is generally robust to structural bias. Unlike the case with GA and PSO, population size seems to have no influence on DE structural bias. Only one of variants studied – DE/current-to-best/1/bin – shows clear signs of bias, however, we show that this effect is mitigated by a judicious choice of constraint handling technique. These findings contribute towards explaining widespread success of DE variants in algorithm comparison studies; its robustness to structural bias represents the absence of a factor that may confound other algorithms.

This paper investigates whether optimisation methods with the population made up of one solution can suffer from structural bias just like their multisolution variants. Following recent results highlighting the importance of choice of strategy for handling solutions generated outside the domain, a selection of single solution methods are considered in conjunction with several such strategies. Obtained results are tested for the presence of structural bias by means of a traditional approach from literature and a newly proposed here statistical approach. These two tests are demonstrated to be not fully consistent. All tested methods are found to be structurally biased with at least one of the tested strategies. Confirming results for multisolution methods, it is such strategy that is shown to control the emergence of structural bias in single solution methods. Some of the tested methods exhibit a kind of structural bias that has not been observed before.

By reinterpreting the calibration of structural models, a reassessment of the importance of the input variables is undertaken. The analysis shows that volatility is the key parameter to any calibration exercise by several orders of magnitude. In order to maximize the sensitivity to volatility, a simple formulation of Merton’s model is proposed that employs deep out-of-the-money option implied volatilities. The methodology also eliminates the use of historic data to specify the default barrier thereby leading to a full risk neutral calibration. Subsequently, a new technique for identifying and hedging capital structure arbitrage opportunities is illustrated. The approach seeks to hedge the volatility risk, or vega, as opposed to the exposure from the underlying equity itself, or delta. The results question the efficacy of the common arbitrage strategy of only executing the delta hedge.

This paper proposes an optimal trading algorithm based on a novel application of the conventional Control Engineering (CE). We consider a fundamental CE concept, namely, the feedback control and apply it to the Algorithmic Trading (AT). The concrete feedback control strategy is designed in a form of the celebrated Proportional-Integral-Derivative (PID) model. The highly fluctuating nature of the modern financial markets has led to the adoption of a model-free realisation of the generic PID framework. The control theoretical methodology we propose is combined with the advanced statistics for the historical market data. We obtain a specific log-normal probability distribution function (pdf) associated with the specific quantities associated with the available stock data. The empirical log-normal pdf mentioned above makes it possible the necessary PID gains optimization. For this aim, we apply the data-driven optimization approaches and consider the corresponding Monte Carlo solution procedure. The optimized PID trading algorithm we propose is also studied in the Fourier analysis framework. This equivalent frequency domain representation involves a new concept in the financial engineering, namely, the "stock market energy" concept. For the evaluation, we implement the proposed PID optimal trading algorithm and develop a Python based prototype software. We finally apply the corresponding prototype software to a dataset from the Binance BTC / USDT stock market. The experimental result illustrates the implementability of the proposed optimal PID trading scheme and also shows the effectiveness of the proposed CE methods in the modern AT.

An approach to the implementation of neural network for real-time cryptographic data protection with symmetric keys oriented on embedded systems is presented. This approach is valuable especially for onboard communication systems in unmanned aerial vehicles (UAV) because of suitability to hardware implementation. In this study we evaluate the possibility to build such a system in hardware implementation at FPGA. The proposed integrated neural network approach for real-time cryptographic data protection was based on theoretical foundations of neural network cryptographic data protection, new algorithms and structures of neural network data encryption and decryption, modern hardware components with programmable structure. The development and implementation of the on-board neural network system for cryptographic data protection in real-time are based on the following principles: variable composition of equipment; modularity; conveyorization and spatial parallelism; hardware and software modification and making them suitable for data encryption and decryption. The tabular-algorithmic method for calculation of the scalar product has been improved that makes it possible to perform fast calculation of the scalar product of fixed-point and floating-point input data by bringing them to the largest common order of weights and forming tables of macro-partial products. Components of neural network cryptographic data encryption and decryption have been developed on the processor core supplemented by specialized scalar product calculation modules. The specialized hardware for neural network cryptographic data encryption was developed using VHDL for equipment programming in the Quartus II development environment ver. 13.1 and the appropriate libraries, and implemented on the basis of the FPGA EP3C16F484C6 Cyclone III family.

Music-domain visual programming languages (VPLs) have shown to be Turing complete. However, the common lack of built-in flow control structures can obstruct using VPLs implementing general-purpose algorithms, which harms the direct use of algorithms and algorithm theory in art creation processes using VPLs. In this article, we show how to systematically implement general-purpose algorithms in music-domain visual languages by using the Finite State Machines with Datapath computation model. The results expose a finite state machine and a set of internal state variables that walk paths whose speed can be controlled using a metronome ticks and whose path depends on the initial conditions of the algorithm. These elements can be further mapped to music elements according to the musician's intentions. We demonstrate this technique by implementing Euclid's Greatest Common Divider algorithm and using it to control high-level music elements in an implementation of Terry Riley's In C, and to control audio synthesis parameters in a FM synthesizer.

Firstly, we present a more explicit formulation of the complete system $D(N)$ of representatives of Manin's symbols over $\mathbb{Q}$, which was initially given by Shimura. Then we establish a bijection between $D(M)\times D(N)$ and $D(MN)$ for $(M,N)=1$, which reveals a recursive structure between Manin's symbols of different levels. Based on Manin's complete system $\Pi (N)$ of representatives of cusps on $X_0(N)$ and Cremona's characterization of the equivalence between cusps, we establish a bijection between a subset $C(N)$ of $D(N)$ and $\Pi (N)$, and then establish a bijection between $C(M)\times C(N)$ and $C(MN)$ for $(M,N)=1$. We also provide a recursive structure for elliptical points on $X_0(N)$. Based on these recursive structures, we obtain recursive algorithms for constructing Manin symbols over $\mathbb{Q}$, cusps and elliptical points on $X_0(N)$. This gives rise to a more efficient algorithms for modular elliptic curve. As direct corollaries of these recursive structures, we present a recursive version of the genus formula and an elementary proof of formulas of the numbers of $D(N)$, cusps and elliptical points on $X_0(N)$.

In this paper, by extending some results of informational genomics, we present a new randomness test based on the empirical entropy of strings and some properties of repeatability and unrepeatability of substrings of certain lengths. We give the theoretical motivations of our method and some experimental results of its application to a wide class of strings: decimal representations of real numbers, roulette outcomes, logistic maps, linear congruential generators, quantum measurements, natural language texts, and genomes. It will be evident that the evaluation of randomness resulting from our tests does not distinguish among the different sources of randomness (natural, or pseudo-casual).

The neural network technology for real-time cryptographic data protection with symmetric keys (masking codes, neural network architecture and weights matrix) for unmanned aerial vehicles (UAV) onboard communication systems has been developed. It provides hardware and software implementation with high technical and operational characteristics. The development of neural network technology for real-time cryptographic data protection was performed using an integrated approach based on theoretical foundations of neural network cryptographic data protection, new algorithms and structures of neural network data encryption and decryption, modern element base with the possibility of programming for the structure, and computer-aided design of hardware and software tools. The development and implementation of the on-board system of neural network cryptographic data protection in real-time are based on the following principles: variable composition of equipment; modularity; conveyorization and spatial parallelism; specialization and adaptation of hardware and software to data encryption and decryption. The tabular-algorithmic method of calculating the scalar product has been improved, it provides fast calculation of the scalar product of input data for both fixed and floating-point by bringing to the largest common order of weights and forming tables of macro-partial products for them. Components of neural network cryptographic data encryption and decryption have been developed on the processor core supplemented by specialized scalar product calculation modules. The specialized hardware for neural network cryptographic data encryption was developed using VHDL for equipment programming in the Quartus II development environment ver. 13.1 and the appropriate libraries, and implemented on the basis of the FPGA EP3C16F484C6 Cyclone III family.

In this article, we investigate limitations of importing methods based on algorithmic information theory from monoplex networks into multidimensional networks (such as multilayer networks) that have a large number of extra dimensions (i.e., aspects). In the worst-case scenario, it has been previously shown that node-aligned multidimensional networks with non-uniform multidimensional spaces can display exponentially larger algorithmic information (or lossless compressibility) distortions with respect to their isomorphic monoplex networks, so that these distortions grow at least linearly with the number of extra dimensions. In the present article, we demonstrate that node-unaligned multidimensional networks, either with uniform or non-uniform multidimensional spaces, can also display exponentially larger algorithmic information distortions with respect to their isomorphic monoplex networks. However, unlike the node-aligned non-uniform case studied in previous work, these distortions in the node-unaligned case grow at least exponentially with the number of extra dimensions. On the other hand, for node-aligned multidimensional networks with uniform multidimensional spaces, we demonstrate that any distortion can only grow up to a logarithmic order of the number of extra dimensions. Thus, these results establish that isomorphisms between finite multidimensional networks and finite monoplex networks do not preserve algorithmic information in general and highlight that the algorithmic information of the multidimensional space itself needs to be taken into account in multidimensional network complexity analysis.

Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics. The canonical computation model of the Turing machine is restricted in time and space resources, to make the target metrics computable under realistic assumptions. The universal prior distribution for the automata is obtained as a quantum superposition, which is further conditioned to estimate the metrics. Specific cases are explored where the quantum implementation offers polynomial advantage, in contrast to an indispensable exhaustive enumeration in the corresponding classical case. The unstructured output data and the computational irreducibility of Turing machines make this algorithm impossible to approximate using heuristics. Thus, exploring the space of program-output relations is one of the most promising problems for demonstrating quantum supremacy using Grover search that cannot be dequantized. Experimental use cases for quantum acceleration are developed for self-replicating programs and algorithmic complexity of short strings. With quantum computing hardware rapidly attaining technological maturity, we discuss how this framework will have significant advantage for various genomics applications in meta-biology, phylogenetic tree analysis, protein-protein interaction mapping and synthetic biology. This is the first time experimental algorithmic information theory is implemented using quantum computation. Our implementation on the Qiskit quantum programming platform is copy-left and can be found on https://github.com/Advanced-Research-Centre/QPULBA

The Stochastic Optimisation Software (SOS) is a Java platform facilitating the algorithmic design process and the evaluation of metaheuristic optimisation algorithms. It reduces the burden of coding miscellaneous methods for dealing with several bothersome and time-demanding tasks such as parameter tuning, implementation of comparison algorithms and testbed problems, collecting and processing data to display results, measuring algorithmic overhead, etc. SOS provides numerous off-the-shelf methods including 1) customised implementations of statistical tests, such as the Wilcoxon Rank-Sum test and the Holm-Bonferroni procedure, for comparing performances of optimisation algorithms and automatically generate result tables in PDF and LaTeX formats; 2) the implementation of an original advanced statistical routine for accurately comparing couples of stochastic optimisation algorithms; 3) the implementation of a novel testbed suite for continuous optimisation, derived from the IEEE CEC 2014 benchmark, allowing for controlled activation of the rotation operator. each testbed function. Moreover, this article comments on the current state of the literature in stochastic optimisation and highlights similarities shared by modern metaheuristics inspired by nature. It is argued that the vast majority of these algorithms are simply a reformulation of the same methods and that metaheuristics for optimisation should be simply treated as stochastic processes with less emphasis on the inspiring metaphor behind them.

Interdisciplinary conferences play a vital role in advancing explainable Artificial Intelligence (AI) within increasingly intersecting healthcare and computational biology arenas. Challenges result-ing from algorithmic bias and the necessity for domain-specific Explainable AI (XAI) techniques underscore the increasing significance of transparent and interpretable AI systems used in patient care. Collaborative efforts between clinicians, data scientists, and various stakeholders are nec-essary to innovate solutions tailored to healthcare needs. Specialized conferences may foster these interdisciplinary interactions, providing platforms for knowledge exchange, networking, and collaborative partnerships. The legal, ethical, and societal dimensions of medical AI advocate for an integrative approach that aligns technological advancements with patient-centered care val-ues. The role of specialized conferences is therefore essential for shaping future directions in ex-plainable AI and computational biology that contribute to improved patient outcomes and healthcare innovations.

Abstract:The digital landscape is rapidly reshaping under the influence of AI-powered cloud-based e-commerce platforms (PCEPs). These platforms leverage the transformative power of AI to personalize customer experiences, optimize pricing strategies, enhance security, and streamline operations, offering businesses a significant competitive edge. However, challenges surrounding data privacy, algorithmic bias, and potential job displacement raise crucial ethical questions regarding widespread AI adoption in e-commerce.This study delves into the untapped potential and ethical considerations of PCEPs, distinguishing itself by proposing practical strategies for responsible development and ethical implementation.Objectives: Investigate the transformative potential of PCEPs: Personalized product recommendations:Analyze effectiveness and potential bias. Dynamic pricing strategies:Explore impact on consumer fairness and market stability. Enhanced fraud detection:Evaluate accuracy and privacy implications. Optimized supply chain management:Assess efficiency gains and job displacement risks. Critically analyze the ethical considerations of AI in e-commerce: Data privacy:Assess current practices and develop mitigation strategies. Algorithmic bias:Identify potential sources and propose solutions for fairer decision-making. Job displacement:Evaluate impacts and propose reskilling initiatives. Propose comprehensive and practical strategies for responsible PCEP development and implementation: Transparency:Enhance user awareness and control over data usage. Fairness:Design AI systems to mitigate bias and uphold consumer rights. Accountability:Establish clear guidelines and oversight mechanisms for ethical AI development.Conclusion: While PCEPs offer a plethora of transformative benefits, their ethical implementation is paramount. By adhering to principles of transparency, fairness, and accountability, businesses can unlock the full potential of PCEPs while minimizing potential risks and shaping the future of online commerce in a sustainable and equitable manner