Computer Runtimes and the Length of Proofs
Author:
- 1 January 2012
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 224-240
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomnessApplied Mathematics and Computation, 2012
- Most programs stop quickly or never haltAdvances in Applied Mathematics, 2008
- The AProS Project: Strategic Thinking & Computational LogicLogic Journal of the IGPL, 2007
- A New Kind of ScienceApplied Mechanics Reviews, 2003
- The Next Waldmeister LoopLecture Notes in Computer Science, 2002
- COMPUTING THE BUSY BEAVER FUNCTION1987
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMSRussian Mathematical Surveys, 1970
- Computer Studies of Turing Machine ProblemsJournal of the ACM, 1965
- On Non-Computable FunctionsBell System Technical Journal, 1962