a recursion-theoretic approach to np：一种递归理论方法.pdfVIP

Annals of Pure and Applied Logic 162 (2011) 661–666 Contents lists available at ScienceDirect Annals of Pure and Applied Logic journal homepage: /locate/apal A recursion-theoretic approach to NP I. Oitavem ∗ Dept. Matemática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, 2829-516 Caparica, Portugal CMAF-UL, Av. Prof. Gama Pinto 2, 1649-003 Lisboa, Portugal a r t i c l e i n f o a b s t r a c t Article history: An implicit characterization of the class NP is given, without using any minimization Received 21 December 2009 scheme. This is the first purely recursion-theoretic formulation of NP . Received in revised form 9 December 2010 © 2011 Elsevier B.V. All rights reserved. Accepted 23 December 2010 Available online 1 March 2011 Communicated by S.R. Buss MSC: 03D20 03D15 68Q15 03D70 Keywords: Computational complexity Implicit characterization Recursion schemes NP 1. Introduction This paper forms part of a broader project which aims to extend the characterization of FPtime [3], due to Bellantoni and Cook, in order to reach well-known classes of computational complexity. It uses the concept of recursion schemes with pointers, as in [4]. Such recursion schemes have been used to characterize classes of complexity that are, or can be, associated with non-sequential/non-deterministic computations. This is the case of the class NC [4,6], and within it the classes NCk [5], and the class FPspace [7]. Here we use a form of recursion with pointers to extend the Bellantoni–Cook characterization of FPtime, in order to characterize NP. There is already a charac