Relativizing an incompressible number and an incompressible function through subrecursive extensions of Turing machines

We show in this article that uncomputability is also a relative property of subrecursive classes built on a recursive relative incompressible function, which acts as a higher-order "yardstick" of irreducible information for the respective subrecursive class. We define the concept of a Turing submachine, and a recursive relative version for the Busy Beaver function and for the halting probability (or Chaitin's constant) Omega; respectively the Busy Beaver Plus (BBP) function and a time-bounded halting probability. Therefore, we prove that the computable BBP function defined on any Turing submachine is neither computable nor compressible by any program running on this submachine. In addition, we build a Turing submachine that can use lower approximations to its own time-bounded halting probability to calculate the values of its Busy Beaver Plus function, in the "same" manner that universal Turing machines use approximations to Omega to calculate Busy Beaver values. Thus, the algorithmic information carried by the BBP function is relatively incompressible (and uncomputable) at the same time that it still is occasionally reached by submachines. We point that this phenomenon enriches the research on the relativization and simulation of uncomputability and irreducible information.

[1]  Alan M. Turing,et al.  Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.

[2]  H. E. Rose.  Subrecursion: Functions and Hierarchies , 1984 .

[3]  Hector Zenil.  Randomness Through Computation: Some Answers, More Questions , 2011 .

[4]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[5]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[6]  Mathieu Hoyrup.  The Decidable Properties of Subrecursive Functions , 2016, ICALP.

[7]  Sanat K. Basu.  On the Structure of Subrecursive Degrees , 1970, J. Comput. Syst. Sci..

[8]  Walter Carnielli,et al.  Are the foundations of computer science logic-dependent? , 2008 .

[9]  G. Chaitin.  Computational complexity and Gödel's incompleteness theorem , 1971, SIGA.

[10]  B. Jack Copeland,et al.  Hypercomputation , 2004, Minds and Machines.

[11]  Dexter Kozen,et al.  Indexings of Subrecursive Classes , 1980, Theor. Comput. Sci..

[12]  Kenneth W. Regan.  Diagonalization, Uniformity, and Fixed-Point Theorems , 1992, Inf. Comput..

[13]  Hector Zenil,et al.  A Computable Universe: Understanding and Exploring Nature As Computation , 2012 .

[14]  Felipe S. Abrahão,et al.  Metabiología: los orígenes de la creatividad biológica , 2014 .

[15]  Dexter Kozen,et al.  Automata and Computability , 1997, Undergraduate Texts in Computer Science.

[16]  Gregory Chaitin,et al.  Life as Evolving Software , 2012 .

[17]  Lance Fortnow,et al.  Diagonalization , 2000, Bull. EATCS.

[18]  Cristian Claude,et al.  Information and Randomness: An Algorithmic Perspective , 1994 .

[19]  Eric Allender,et al.  The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory , 2009, J. Comput. Syst. Sci..

[20]  Steven Homer,et al.  Computability and Complexity Theory , 2001, Texts in Computer Science.

[21]  Apostolos Syropoulos,et al.  Hypercomputation: Computing Beyond the Church-Turing Barrier , 2008 .

[22]  André Nies,et al.  Relativizing Chaitin's Halting Probability , 2005, J. Math. Log..

[23]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[24]  Paul M. B. Vitányi,et al.  An Introduction to Kolmogorov Complexity and Its Applications, Third Edition , 1997, Texts in Computer Science.

[25]  Jeffrey Shallit,et al.  Proving Darwin: Making Biology Mathematical , 2012 .

[26]  Osamu Watanabe,et al.  Kolmogorov Complexity and Computational Complexity , 2012, EATCS Monographs on Theoretical Computer Science.

[27]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.

[28]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[29]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[30]  Hector Zenil,et al.  The Limits of Decidable States on Open-Ended Evolution and Emergence , 2016, ALIFE.

[31]  Felipe S. Abrahão.  The "paradox" of computability and a recursive relative version of the Busy Beaver function , 2016, ArXiv.

[32]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.