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.

Is it possible to develop a meaningful measure for the complexity of a simulation model? Algorithmic information theory provides concepts that have been applied in other areas of research for the practical measurement of object complexity. This article offers an overview of complexity from a variety of perspectives and provides a body of knowledge with respect to the complexity of simulation models. Key terms of model detail, resolution, and scope are defined. An important concept from algorithmic information theory, Kolmogorov complexity, and an application of this concept, normalized compression distance, are used to indicate the possibility of measuring changes in model detail. Additional research in this area can advance the modeling and simulation body of knowledge toward the practical application of measuring simulation model complexity. Examples show that KC and NCD measurements of simulation models can detect changes in scope and detail.

The notion of information and complexity are important concepts in many scientific fields such as molecular biology, evolutionary theory, and exobiology. Many measures of these quantities, either rely on a statistical notion of information, are difficult to compute, or can only be applied to strings. Based on assembly theory, we propose the notion of a \textit{ladderpath}, which describes how an object can be decomposed into a hierarchical structure using repetitive elements. From the ladderpath two measures naturally emerge: the ladderpath-index and the order-index, which represent two axes of complexity. We show how the ladderpath approach can be applied to both strings and spatial patterns and argue that all systems that undergo evolution can be described as ladderpaths. Further, we discuss possible applications to human language and the origins of life. The ladderpath approach provides a novel characterization of the information that is contained in a single object (or a system) and could aid in our understanding of evolving systems and the origin of life in particular.

Why are simple, regular, and symmetric shapes common in nature? Many natural shapes arise as solutions to energy minimisation or other optimisation problems, but is there a general relation between optima and simple, regular shapes and geometries? Here we argue from algorithmic information theory that for objective functions common in nature --- based on physics and engineering laws --- optimal geometries will be simple, regular, and symmetric. Further, we derive a null model prediction that if a given geometry is an optimal solution for one natural objective function, then it is a priori more likely to be optimal or close to optimal for another objective function.

Coalescence of nanowires and other three-dimensional structures into continuous film is desirable for growing low dislocation density III-nitride and III-V materials on lattice-mismatched substrates, and interesting from the fundamental viewpoint. Here, we develop a growth model for vertical nanowires which, under rather general assumptions on the solid-like coalescence process within the Kolmogorov crystallization theory, results in a morphological diagram for the asymptotic coverage of a substrate surface. The coverage is presented as a function of two variables, the material collection efficiency on the top nanowire facet a, and the normalized surface diffusion flux of adatoms from the NW sidewalls b. The full coalescence of nanowires is possible only when a=1 regardless of b. At a>1, which is usual for vapor-liquid-solid growth with a catalyst droplet, nanowires can only partly merge but never coalesce into continuous film. These results can be used for predicting and controlling the degree of surface coverage by nanowires and three-dimensional islands by tuning the surface density, droplet size, adatoms diffusivity, and geometry of the initial structures in the vapor-liquid-solid, selective area or self-induced growth processes in different epitaxy techniques.

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.

Therapeutic proteins are used to successfully treat hemophilia, Crohn’s Disease, diabetes, and cancer. Recent product recalls have occurred because of sub-visible particle formation resulting from the inherent instability of proteins. It has been suggested that particle formation is associated with late stage processing steps of filling, shipping, and delivery. Previous works demonstrated that cavitation might occur in therapeutic vials subjected to agitation or accidentally dropped, but that mitigation can be achieved with fluid property manipulation. The goal of this research was to (1) assess the risk of cavitation under common pharmaceutical manufacturing conditions (i.e., pipe contraction and pumps), (2) establish a simple threshold criterion for when particulate will form, and (3) suggest a series of mitigation techniques based on these thresholds. To accomplish these tasks, computational fluid dynamic simulations for a variety of pipe contraction and fluid properties were performed. The results of this research show that reducing the turbulence in a fluid system will reduce the likelihood of cavitation. Additionally, threshold bounds were created that establish a definitive transition at which cavitation will occur.

Wave buoy measurements were carried out near the north-eastern Black Sea coast at the natural reserve Utrish in 2020-2021. In total, about 11 months of data records were collected during two stages of the experiment at 600 and 1500 meters offshore and depths of 18 and 42 meters. The measured waves propagate almost exclusively from the seaward directions. Generally, the waves do not follow the local wind directions, thus, implying a mixed sea state. Nevertheless, dimensionless wave heights and periods appears to be quite close to the previously established empirical laws for the wind-driven seas. The results of the wave turbulence theory are applied for estimates of spectral energy fluxes and their correspondence to the energy flux from the turbulent wind pulsations. These estimates are consistent with today's understanding of wind-wave interaction. It is shown that the main fraction of the wind energy flux goes to the direct Kolmogorov-Zakharov cascade to high wave frequencies and then to dissipation in small scales. Less than 1% of the wind energy flux is directed to low frequency band (the so-called inverse Kolmogorov-Zakharov cascade), thus, providing wave energy growth.

In this paper, we will consider an autonomous two-dimensional ODE Kolmogorov type 1 system with three parameters, which is a particular system of the general predator–prey systems with 2 a Holling type II. By reformulating this system as a set of two second order differential equations, we 3 will investigate the nonlinear dynamics of the system from the Jacobi stability point of view, using 4 the Kosambi-Cartan-Chern (KCC) geometric theory. We will determine the nonlinear connection, the 5 Berwald connection and the five KCC-invariants which express the intrinsic geometric properties 6 of the system, including the deviation curvature tensor. Furthermore, we will obtain necessary and 7 sufficient conditions on the parameters of the system in order to have the Jacobi stability near the 8 equilibrium points and we will point out these on a few examples.

We present a general process for the halting problem, valid regardless of the time and space computational complexity of the decision problem. It can be interpreted as the maximization of entropy for the utility function of a given Shannon-Kolmogorov-Bernoulli process. Applications to non-polynomials problems are given. The new interpretation of information rate proposed in this work is a method that models the solution space boundaries of any decision problem (and non polynomial problems in general) as a communication channel by means of Information Theory. We described a sort method that order objects using the intrinsic information content distribution for the elements of a constrained solution space - modeled as messages transmitted through any communication systems. The limits of the search space are defined by the Kolmogorov-Chaitin complexity of the sequences encoded as Shannon-Bernoulli strings. We conclude with a discussion about the implications for general decision problems in Turing machines.

We provide methodology and numerical results for the Hattendorff differential equa- tion for the continuous time evolution of the variance of L(j)t , the loss at time t random variable for a multi-state process, given that the state at time t is j.

In the paper we present a new test for comparison of the means of multivariate samples with unknown distributions. The test is based on the comparison of the distributions of the distances between the samples’ elements and their means using univariate two-sample Kolmogorov-Smirnov test. The activity of the suggested method is illustrated by numerical analysis of the real-world and simulated data.

Exact sequential state estimation of orbiting objects in space can be found by predicting the state using Fokker Planck Kolmogorov Equation (FPKE) and measurement correction using Bayes’ conditional/posterior Probability Density Function (PDF). Posterior PDF can be expressed as Gaussian density expanded in terms of Hermite polynomials named as Gram Charlier Series (GCS). This research is an extension of an earlier work on second order linearized solution to nonlinear Bayesian filtering using Taylor series and third order GCS expansion of posterior PDF. In this new extension, Bayes’ posterior PDF is approximated by a mixture of GCS functions for which the parameters are propagated using linear propagation theory. The update of weights of different components of GCS mixture model uses the FPKE error as feedback to adapt for the amplitude of different GCS components while solving a quadratic programming problem earlier used for Gaussian Mixture Model (GMM) PDF. Proposed filtering method is applied on tracking of space debris. The simulation results for the filter shows performance is moderately better than single GCS filter, Extended Kalman Filter (EKF) and Gaussian Sum Filter (GSF) under space debris’ highly uncertain initial conditions and sparse measurement availability.

The aim of this work is to study generalizations of the notion of mean. Kolmogorov proposed a generalization based on an improper integral with a decay rate for the tail probabilities. This weak or Kolmogorov mean relates to the Weak Law of Large Numbers in the same way that the ordinary mean relates to the Strong Law. We propose a further generalization, also based on an improper integral, called the doubly weak mean, applicable to heavy-tailed distributions such as the Cauchy distribution and the other symmetric stable distributions, We also consider generalizations arising from Abel-Feynman type mollifiers that damp the behavior at infinity and alternative formulations of the mean in terms of the cumulative distribution and the characteristic function.

We extended the usage of the expansion method based on Sine-Gordon equation to the two dimensional Fisher equation. The relation between the trigonometric and hyperbolic functions are derived from the Sine-Gordon equation dened in two space dimension. The complex-valued traveling wave solutions to the two dimensional Fisher and Nagumo equations are set in forms a nite series of multiplications of powers of sech(.) and tanh(.) functions.

Distributed Systems architectures are becoming the standard computational model for processing and transportation of information, especially for Cloud Computing environments. The increase in demand for application processing and data management from enterprise and end-user workloads continues to move from a single-node client-server architecture to a distributed multitier design where data processing and transmission are segregated. Software development must considerer the orchestration required to provision its core components in order to deploy the services efficiently in many independent, loosely coupled - physically and virtually interconnected - data centers spread geographically, across the globe. This network routing challenge can be modeled as a variation of the Travelling Salesman Problem (TSP). This paper proposes a new optimization algorithm for optimum route selection using Algorithmic Information Theory. The Kelly criterion for a Shannon-Bernoulli process is used to generate a reliable quantitative algorithm to find a near optimal solution tour. The algorithm is then verified by comparing the results with heuristic solutions in 3 test cases. A statistical analysis is designed to measure the significance of the results between the algorithms and the entropy function can be derived from the distribution. The tested results shown an improvement in the solution quality by producing routes with smaller length and time requirements. The quality of the results proves the flexibility of the proposed algorithm for problems with different complexities without relying in nature-inspired models such as Genetic Algorithms and Simulated Annealing. This algorithm can be used by orchestration applications to deploy services across large cluster of nodes by making better decision in the route design.

During the last years some new variants of Permutation entropy have been introduced and applied to EEG analysis, among them a conditional variant and variants using some additional metric information or being based on entropies different from the Shannon entropy. In some situations it is not completely clear what kind of information the new measures and their algorithmic implementations provide. We discuss the new developments and illustrate them for EEG data.

We start with the discussion on misapplication of classical probability theory by Feynman in his analysis of the two slit experiment (by following the critical argumentation of Koopman, Ballentine, and the author of this paper). The seed of Feynman's conclusion on the impossibility to apply the classical probabilistic description for the two slit experiment is treatment of conditional probabilities corresponding to different experimental contexts as unconditional ones. Then we move to the Bell type inequalities. Bell applied classical probability theory in the same manner as Feynman and, as can be expected, he also obtained the impossibility statement. In contrast to Feynman, he formulated his no-go statement not in the probabilistic terms, but by appealing to nonlocality. This note can be considered as a part of the author's attempts for getting rid off nonlocality from quantum physics.

We employ hierarchy of models (HoM) with 2, 3 and 4 parameters to reanalyze the nucleation kinetics in the electrodeposition as quantified by n(t) - “the number of nuclei vs. time” data obtained at different overvoltages from precise experiments on electrodeposition of Hg on two different types of Pt-cathodes by Ivan V. Markov and Evgenia Stoycheva [1]. The obtained two scales, nmax and , are used to rescale the original data mapping it on a master curve in coordinates . Our main result is obtained by studying further the dependence of these two scales on the overvoltage (analogue of supersaturation). Surprisingly, for one of the two cathode types - the “hemispherical single-crystal electrode” (as defined by the authors), there is discontinuity in the “ vs. overvoltage” dependence – an almost horizontal jump from 85 to 86 mV accompanied by a change in the slope of the dependence - it is ~ -1 and ~ -0.5 after. For the other cathode - “plane structureless platinum electrode”,  decreases smoothly. Combined, these two behaviors point at the so called “cusp catastrophe”. We compare our findings with published results on protein nucleation.

We outline and test a new methodology for genuine simulation of stochastic processes with any dependence and any marginal distribution. We reproduce time dependence with a generalized, time symmetric or asymmetric, moving-average scheme. This implements linear filtering of non-Gaussian white noise, with the weights of the filter determined by analytical equations in terms of the autocovariance of the process. We approximate the marginal distribution of the process, irrespective of its type, using a number of its cumulants, which in turn determine the cumulants of white noise in a manner that can readily support the generation of random numbers from that approximation, so that it be applicable for stochastic simulation. The simulation method is genuine as it uses the process of interest directly without any transformation (e.g. normalization). We illustrate the method in a number of synthetic and real-world applications with either persistence or antipersistence, and with non-Gaussian marginal distributions that are bounded, thus making the problem more demanding. These include distributions bounded from both sides, such as uniform, and bounded form below, such as exponential and Pareto, possibly having a discontinuity at the origin (intermittence). All examples studied show the satisfactory performance of the method.

I review previous attempts, including recent ones, to introduce technical aspects of digital information and computation into the discussion of ethics. I survey some limitations and advantages of these attempts to produce guiding principles at different scales. In particular, I briefly introduce and discuss questions, approaches, challenges, and limitations based on, or related to, simulation, information theory, integrated information, computer simulation, intractability, algorithmic complexity, and measures of computational organisation and sophistication. I discuss and propose a set of features that ethical frameworks must possess in order to be considered well-grounded, both in theoretical and methodological terms. I will show that while global ethical frameworks that are uncomputable are desirable because they provide non-teleological direction and open-ended meaning, constrained versions should be able to provide guidelines at more local and immediate time scales. In connection to the ethics of artificial intelligence, one point that must be underscored about computational approaches is that (General) AI should only embrace an ethical framework that we humans are willing to adopt. I think that such a framework is possible, taking the form of a general and universal (in the sense of computation) framework built from first computational principles.

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