Infinite Versions of Some Problems from Finite Complexity Theory

Notre Dame Journal of Formal Logic 37 (4):545-553 (1996)
  Copy   BIBTEX

Abstract

Recently, several authors have explored the connections between NP-complete problems for finite objects and the complexity of their analogs for infinite objects. In this paper, we will categorize infinite versions of several problems arising from finite complexity theory in terms of their recursion theoretic complexity and proof theoretic strength. These infinite analogs can behave in a variety of unexpected ways

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

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
2010-08-24

Downloads
21 (#692,524)

6 months
4 (#678,769)

Historical graph of downloads
How can I increase my downloads?