Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 37, Number 4 (1996), 545-553.
Infinite Versions of Some Problems from Finite Complexity Theory
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.
Notre Dame J. Formal Logic Volume 37, Number 4 (1996), 545-553.
First available in Project Euclid: 16 December 2002
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 03D15: Complexity of computation (including implicit computational complexity) [See also 68Q15, 68Q17]
Secondary: 03D35: Undecidability and degrees of sets of sentences 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.) [See also 03D15, 68Q17, 68Q19]
Hirst, Jeffry L.; Lempp, Steffen. Infinite Versions of Some Problems from Finite Complexity Theory. Notre Dame J. Formal Logic 37 (1996), no. 4, 545--553. doi:10.1305/ndjfl/1040046141. https://projecteuclid.org/euclid.ndjfl/1040046141