We consider a weakly interacting quantum spin chain with random local interactions. We prove that many-body localization follows from a physically reasonable assumption that limits the extent of level attraction in the statistics of eigenvalues. In a Kolmogorov-Arnold-Moser-style construction, a sequence of local unitary transformations is used to diagonalize the Hamiltonian by deforming the in...

The paper considers a method for automatic construction of numerical models for systems described by Markov processes. The embedded Markov chains are used for computation of stationary probabilities of Markov processes. The performance of the system described in the event language is used for generating a system of Kolmogorov equations. An example of a numerical model for the event – driven loc...

I propose a new semantics for intuitionistic logic, which is a cross between the construction-oriented semantics of Brouwer-Heyting-Kolmogorov and the condition-oriented semantics of Kripke. The new semantics shows how there might be a common semantical underpinning for intuitionistic and classical logic and how intuitionistic logic might thereby be tied to a realist conception of the relations...

This paper provides a construction of a Fleming–Viot measure valued diffusion process, for which the transition function is known, by extending recent ideas of the Gibbs sampler based Markov processes. In particular, we concentrate on the Chapman–Kolmogorov consistency conditions which allows a simple derivation of such a Fleming–Viot process, once a key and apparently new combinatorial result ...

In this paper we focus on the stability of the Trojan asteroids for the planar Restricted Three-Body Problem (RTBP), by extending the usual techniques for the neighbourhood of an elliptic point to derive results in a larger vicinity. Our approach is based on the numerical determination of the frequencies of the asteroid and the effective computation of the Kolmogorov normal form for the corresp...

The MDA approach may be broadly reduced to the following lifecycle: defining platform independent business models and transforming them into platform dependent models for software implementation concerns. The NOCE team works in the Technology Enhanced Learning (TEL) area. One of its works aims to apply the MDA approach in TEL domain. This application presents two particularities: the versatilit...

We prove a Kolmogorov complexity variant of the birthday paradox. Sufficiently large random subsets strings are guaranteed to have two members x and y with low K(x/y). To this, we first show that minimum conditional between finite sets is very if they not exotic. Exotic high mutual information halting sequence.

The Australian construction industry is a fragmented and profoundly competitive industry with high levels of subcontracting resulting in complex supply chain formations. Traditional methods and forms of communication are being proven as inefficient and losing their charm while participants face heavy volumes of communications that often occurs on a daily basis between trading partners in a supp...

Solovay showed that there are noncomputable reals α such that H(α ↾ n) 6 H(1) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the connection between algorithmic complexity and effective randomness. We give a new, easier construction of an H-trivial real. We also analyze various computability-theoretic properties of the H-trivial reals, showing f...