Computational complexity and Godel's incompleteness theorem

Abstract

Given any simply consistent formal theory F of the state complexity L(S) of finite binary sequences S as computed by 3-tape-symbol Turing machines, there exists a natural number L(F ) such that L(S) > n is provable in F only if n L(F ). The proof resembles Berry’s..

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,813

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2009-02-15

Downloads
109 (#165,002)

6 months
1 (#1,507,095)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references