Computer Science – Computational Complexity
Scientific paper
2012-01-04
Computer Science
Computational Complexity
forthcoming in M.J. Dinneen, B Khoussainov and A. Nies (eds), "Computation, Physics and Beyond", LNCS, Springer (Cristian S. C
Scientific paper
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.
No associations
LandOfFree
Computer Runtimes and the Length of Proofs: On an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computer Runtimes and the Length of Proofs: On an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer Runtimes and the Length of Proofs: On an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-156234