Small Turing Research Articles

On some FPT problems without polynomial Turing compressions

An impressive hardness theory which can prove compression lower bounds for a large number of FPT problems has been established under the assumption that NP ⊈ coNP/poly. However, there are no problems in FPT for which the existence of polynomial Turing compressions under any widely believed complexity assumptions has been excluded. In this paper, we provide a technique which can be used to prove that some FPT problems have no small Turing compressions under the assumption that there exists a problem in NP which does not have small-sized circuits. These FPT problems, which include edge clique cover parameterized by the number of cliques, integer linear programming and a-choosability parameterized by some structural parameters, etc. have the property that they remain NP-hard under Cook reductions even if their parameter values are small. Moreover, a trade-off between the size of the Turing compression lower bound and the robustness of the complexity assumption is obtained. In particular, we demonstrate that these FPT problems have no polynomial Turing compressions unless every set in NP has quasi-polynomial-sized circuits, and have no 2o(k) Turing compressions unless every set in NP has sub-exponential-sized circuits. Additionally, Turing kernelization lower bounds for these FPT problems are provided under some weaker complexity assumptions. Lastly, compression lower bounds for the above-mentioned FPT problems are proved under some complexity assumptions which are weaker than NP ⊈ coNP/poly, moreover, these results are proved under a method which is different from the previous hardness theory for compression lower bounds.

Wavelength of a Turing-type mechanism regulates the morphogenesis of meshwork patterns

The meshwork pattern is a significant pattern in the development of biological tissues and organs. It is necessary to explore the mathematical mechanism of meshwork pattern formation. In this paper, we found that the meshwork pattern is formed by four kinds of stalk behaviours: stalk extension, tip bifurcation, side branching and tip fusion. The Turing-type pattern underlying the meshwork pattern is a Turing spot pattern, which indicates that the Turing instability of the spot pattern promotes activator peak formation and then guides the formation of meshwork patterns. Then, we found that the Turing wavelength decreased in turn from tip bifurcation to side branching to tip fusion via statistical evaluation. Through the functional relationship between the Turing wavelength and model parameters (upvarepsilon ,{ rho }_{A} and {rho }_{H}), we found that parameters upvarepsilon and {rho }_{H} had monotonic effects on the Turing wavelength and that parameter {rho }_{A} had nonmonotonic effects. Furthermore, we performed simulations of local meshwork pattern formation under variable model parameter values. The simulation results verified the corresponding relationship between the Turing wavelength and stalk behaviours and the functional relationship between the Turing wavelength and model parameters. The simulation results showed that the Turing wavelength regulated the meshwork pattern and that the small Turing wavelength facilitated dense meshwork pattern formation. Our work provides novel insight into and understanding of the formation of meshwork patterns. We believe that studies associated with network morphogenesis can benefit from our work.

A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences

Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity and that, usually, generic lossless compression algorithms fall short at characterizing features other than statistical ones not different from entropy evaluations, here we explore an alternative and complementary approach. We study formal properties of a Levin-inspired measure m calculated from the output distribution of small Turing machines. We introduce and justify finite approximations mk that have been used in some applications as an alternative to lossless compression algorithms for approximating algorithmic (Kolmogorov-Chaitin) complexity. We provide proofs of the relevant properties of both m and mk and compare them to Levin’s Universal Distribution. We provide error estimations of mk with respect to m. Finally, we present an application to integer sequences from the On-Line Encyclopedia of Integer Sequences, which suggests that our AP-based measures may characterize nonstatistical patterns, and we report interesting correlations with textual, function, and program description lengths of the said sequences.

A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory

Since the definition of the Busy Beaver function by Rado in 1962, an interesting open question has been what the smallest value of n for which BB(n) is independent of ZFC set theory. Is this n approximately 10, or closer to 1,000,000, or is it even larger? In this paper, we show that it is at most 7,918 by presenting an explicit description of a 7,918-state Turing machine Z with 1 tape and a 2-symbol alphabet that cannot be proved to run forever in ZFC (even though it presumably does), assuming ZFC is consistent. The machine is based on work of Harvey Friedman on independent statements involving order-invariant graphs. In doing so, we give the first known upper bound on the highest provable Busy Beaver number in ZFC. We also present a 4,888-state Turing machine G that halts if and only if there is a counterexample to Goldbach’s conjecture, and a 5,372-state Turing machine R that halts if and only if the Riemann hypothesis is false. To create G, R, and Z, we develop and use a higher-level language, Laconic, which is much more convenient than direct state manipulation.

Fractal Dimension versus Process Complexity

We look at small Turing machines (TMs) that work with just two colors (alphabet symbols) and either two or three states. For any particular such machineτand any particular inputx, we consider what we call thespace-timediagram which is basically the collection of consecutive tape configurations of the computationτ(x). In our setting, it makes sense to define a fractal dimension for a Turing machine as the limiting fractal dimension for the corresponding space-time diagrams. It turns out that there is a very strong relation between the fractal dimension of a Turing machine of the above-specified type and its runtime complexity. In particular, a TM with three states and two colors runs in at most linear time, if and only if its dimension is 2, and its dimension is 1, if and only if it runs in superpolynomial time and it uses polynomial space. If a TM runs in timeO(xn), we have empirically verified that the corresponding dimension is(n+1)/n, a result that we can only partially prove. We find the results presented here remarkable because they relate two completely different complexity measures: the geometrical fractal dimension on one side versus the time complexity of a computation on the other side.

Problems in number theory from busy beaver competition

By introducing the busy beaver competition of Turing machines, in 1962, Rado defined noncomputable functions on positive integers. The study of these functions and variants leads to many mathematical challenges. This article takes up the following one: How can a small Turing machine manage to produce very big numbers? It provides the following answer: mostly by simulating Collatz-like functions, that are generalizations of the famous 3x+1 function. These functions, like the 3x+1 function, lead to new unsolved problems in number theory.

Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines.

Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method is an alternative to the traditional lossless compression algorithms, which it may complement, the two being serviceable for different string lengths. We provide a thorough analysis for all binary strings of length and for most strings of length by running all Turing machines with 5 states and 2 symbols ( with reduction techniques) using the most standard formalism of Turing machines, used in for example the Busy Beaver problem. We address the question of stability and error estimation, the sensitivity of the continued application of the method for wider coverage and better accuracy, and provide statistical evidence suggesting robustness. As with compression algorithms, this work promises to deliver a range of applications, and to provide insight into the question of complexity calculation of finite (and short) strings.Additional material can be found at the Algorithmic Nature Group website at http://www.algorithmicnature.org. An Online Algorithmic Complexity Calculator implementing this technique and making the data available to the research community is accessible at http://www.complexitycalculator.com.

Empirical Encounters with Computational Irreducibility and Unpredictability

The paper presents an exploration of conceptual issues that have arisen in the course of investigating speed-up and slowdown phenomena in small Turing machines, in particular results of a test that may spur experimental approaches to the notion of computational irreducibility. The test involves a systematic attempt to outrun the computation of a large number of small Turing machines (3 and 4 state, 2 symbol) by means of integer sequence prediction using a specialized function for that purpose. The experiment prompts an investigation into rates of convergence of decision procedures and the decidability of sets in addition to a discussion of the (un)predictability of deterministic computing systems in practice. We think this investigation constitutes a novel approach to the discussion of an epistemological question in the context of a computer simulation, and thus represents an interesting exploration at the boundary between philosophical concerns and computational experiments.

Small Turing machines and generalized busy beaver competition

Let TM( k, l) be the set of one-tape Turing machines with k states and l symbols. It is known that the halting problem is decidable for machines in TM(2,3) and TM(3,2). We prove that the decidability of machines in TM(2,4) and TM(3,3) will be difficult to settle, by giving machines in these sets for which the halting problem depends on an open problem in number theory. A machine in TM(5,2) with the same result is already known, and, moreover, this machine is the record holder for the busy beaver competitions: this is the machine in TM(5,2) which halts when starting from a blank tape, making the greatest number of steps and leaving the greatest number of non-blank symbols. We give potential winners for similar generalized busy beaver competitions in TM(2,3), TM(2,4) and TM(3,3).

Spectral stability of modulated travelling waves bifurcating near essential instabilities

Localized travelling waves to reaction-diffusion systems on the real line are investigated. The issue addressed in this work is the transition to instability which arises when the essential spectrum crosses the imaginary-axis. In the first part of this work, it has been shown that large modulated pulses bifurcate near the onset of instability; they are a superposition of the primary pulse with spatially periodic Turing patterns of small amplitude. The bifurcating modulated pulses can be parametrized by the wavelength of the Turing patterns. Furthermore, they are time periodic in a moving frame. In the second part, spectral stability of the bifurcating modulated pulses is addressed. It is shown that the modulated pulses are spectrally stable if and only if the small Turing patterns are spectrally stable, that is, if their continuous spectrum only touches the imaginary-axis at zero. This requires an investigation of the period map associated with the time-periodic modulated pulses.