Abstract
This paper is an experimental exploration of the relationship between the runtimes of Turing machines and the length of proofs in formal axiomatic systems. We compare the number of halting Turing machines of a given size to the number of provable theorems of first-order logic of a given size, and the runtime of the longest-running Turing machine of a given size to the proof length of the most-difficult-to-prove theorem of a given size. It is suggested that theorem provers are subject to the same non-linear tradeoff between time and size as computer programs are, affording the possibility of determining optimal timeouts and waiting times in automatic theorem proving. I provide the statistics for some small choices of parameters for both of these systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brady, A.H.: The Determination of the Value of Rado’s Noncomputable Function for Four-State Turing Machines. Math. Comput. 40, 647–665 (1983)
Baumgartner, P., Zhang, H.: On Using Ground Joinable Equations in Equational Theorem Proving. In: Proceedings of the 3rd International Workshop on First Order Theorem Proving (St Andrews, Scotland), Fachberichte Informatik 5/2000, pp. 33–43. Universität Koblenz-Landau (2000)
Calude, C.S., Dinneen, M.J., Shu, C.-K.: Computing a glimpse of randomness. Experimental Mathematics 11(2), 369–378 (2002)
Calude, C.S., Stay, M.A.: Most programs stop quickly or never halt. Advances in Applied Mathematics 40, 295–308 (2005)
Chaitin, G.J.: Computing the Busy Beaver function. Information, Randomness & Incompleteness, 74–76 (1984)
Chaitin, G.J.: A theory of program size formally identical to information theory. J. ACM 22, 329–340 (1975)
Delahaye, J.-P., Zenil, H.: Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance Into the Innermost Structure of Randomness. Appl. Math. Comput. (in press, 2011)
Joosten, J., Soler-Toscano, F., Zenil, H.: Program-size Versus Time Complexity, Speed-up and Slowdown Phenomena in Small Turing Machines. International Journal of Unconventional Computing (2011)
Rado, T.: On Non-Computable Functions. Bell System Technical J. 41, 877–884 (1962)
Sieg, W.: The AProS Project: Strategic Thinking & Computational Logic. Logic Journal of the IGPL 15(4), 359–368 (2007)
Lin, S., Rado, T.: Computer Studies of Turing Machine Problems. J. ACM 12, 196–212 (1965)
Hillenbrand, T., Löchner, B.: The Next WALDMEISTER Loop. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 486–500. Springer, Heidelberg (2002)
Wolfram, S.: A New Kind of Science. Wolfram Media (2002)
Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Surveys 25(6), 83–124 (1970)
Zenil, H.: Busy Beaver, from the Wolfram Demonstrations Project (2009), http://demonstrations.wolfram.com/BusyBeaver/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Zenil, H. (2012). Computer Runtimes and the Length of Proofs. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds) Computation, Physics and Beyond. WTCS 2012. Lecture Notes in Computer Science, vol 7160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27654-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-27654-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27653-8
Online ISBN: 978-3-642-27654-5
eBook Packages: Computer ScienceComputer Science (R0)