Abstract
Assume that the problem Q 0 is not solvable in polynomial time. For theories T containing a sufficiently rich part of true arithmetic we characterize T ∪ {Con T } as the minimal extension of T proving for some algorithm that it decides Q 0 as fast as any algorithm \(\mathbb B\) with the property that T proves that \(\mathbb B\) decides Q 0. Here, Con T claims the consistency of T. Moreover, we characterize problems with an optimal algorithm in terms of arithmetical theories.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cook, S.A., Nguyen, P.: Logical Foundations of Proof Complexity. Cambridge University Press, Cambridge (2010)
Hartmanis, J.: Relations between diagonalization, proof systems, and complexity gaps. Theoretical Computer Science 8, 239–253 (1979)
Hutter, M.: The fastest and shortest algorithm for all well-defined problems. International Journal of Foundations of Computer Science 13, 431–443 (2002)
Krajicèk, J., Pudlák, P.: Propositional proof systems, the consistency of first order theories and the complexity of computations. The Journal of Symbolic Logic 54, 1063–1079 (1989)
Levin, L.: Universal search problems (in Russian). Problemy Peredachi Informatsii 9, 115–116 (1973)
Messner, J.: On optimal algorithms and optimal proof systems. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 361–372. Springer, Heidelberg (1999)
Sadowski, Z.: On an optimal propositional proof system and the structure of easy subsets. Theoretical Computer Science 288, 181–193 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y., Flum, J., Müller, M. (2011). Consistency and Optimality. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-21875-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21874-3
Online ISBN: 978-3-642-21875-0
eBook Packages: Computer ScienceComputer Science (R0)