Skip Navigation


Logic Journal of IGPL Advance Access originally published online on September 24, 2007
Logic Journal of IGPL 2007 15(5-6):445-455; doi:10.1093/jigpal/jzm034
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
15/5-6/445    most recent
jzm034v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Doria, F. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2007. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Fast-Growing Functions and the P vs. NP Question

Francisco Antonio Doria

Fuzzy Sets Research Team, PIT, Production Engineering Program. Room F108, COPPE, UFRJ, P.O. Box 68507, 21945–972 Rio RJ Brazil. E-mail: fadoria{at}pep.ufrj.br


  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 (with da Costa) exotic formalization for P=NP and then speculate about possible ways to extend our work.

Key Words: computational complexity • fast-growing functions • Busy Beaver function • P vs. NP

Received for publication 24 October 2006. Revision received .
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.