From determinism , nondeterminism and alternation to recursion schemes for P , NP and Pspace

Our goal is to approach the classes of computational complexity P, NP, and Pspace in a recursiontheoretic manner. Here we emphasize the connection between the structure of the recursion schemes and the underlying models of computation. 1998 ACM Subject Classification F.4.1 Mathematical Logic, F.1.1 Models of Computation, F.1.2 Modes of Computation, F.1.3… CONTINUE READING