Recursion Theory and Computational Complexity
Title | Recursion Theory and Computational Complexity PDF eBook |
Author | G. Lolli |
Publisher | Springer Science & Business Media |
Pages | 228 |
Release | 2011-06-17 |
Genre | Mathematics |
ISBN | 364211072X |
S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory.
Recursion Theory and Computational Complexity
Title | Recursion Theory and Computational Complexity PDF eBook |
Author | G. Lolli |
Publisher | |
Pages | 242 |
Release | 2011-03-30 |
Genre | |
ISBN | 9783642110757 |
Recursion Theory and Computational Complexity
Title | Recursion Theory and Computational Complexity PDF eBook |
Author | Gabriele Lolli |
Publisher | |
Pages | |
Release | 1981 |
Genre | |
ISBN |
Computational Complexity
Title | Computational Complexity PDF eBook |
Author | Sanjeev Arora |
Publisher | Cambridge University Press |
Pages | 609 |
Release | 2009-04-20 |
Genre | Computers |
ISBN | 0521424267 |
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
A Recursive Introduction to the Theory of Computation
Title | A Recursive Introduction to the Theory of Computation PDF eBook |
Author | Carl Smith |
Publisher | Springer Science & Business Media |
Pages | 155 |
Release | 2012-12-06 |
Genre | Computers |
ISBN | 1441985018 |
The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.
Computational Complexity and Recursion Theory
Title | Computational Complexity and Recursion Theory PDF eBook |
Author | University of Maryland at College Park. Computer Science Center |
Publisher | |
Pages | |
Release | 1979 |
Genre | |
ISBN |
Recursion Theory
Title | Recursion Theory PDF eBook |
Author | Chi Tat Chong |
Publisher | Walter de Gruyter GmbH & Co KG |
Pages | 409 |
Release | 2015-08-17 |
Genre | Mathematics |
ISBN | 311038129X |
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.