Fast-Growing Functions and the P vs. NP Question

Logic Journal of the IGPL 15 (5-6):445-455 (2007)
  Copy   BIBTEX

Abstract

Out of a folklore–like fact about the counterexample function to P=NP, a function which grows about as fast as the Busy Beaver function, we review the consequences of our exotic formalization for P=NP and then speculate about possible ways to extend our work

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2015-02-04

Downloads
15 (#1,236,051)

6 months
6 (#866,322)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references