Recursion Theory and Computational Complexity
Title | Recursion Theory and Computational Complexity PDF eBook |
Author | G. Lolli |
Publisher | Springer Science & Business Media |
Total 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 | |
Total 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 | |
Total Pages | |
Release | 1981 |
Genre | |
ISBN |
Computational Complexity
Title | Computational Complexity PDF eBook |
Author | Sanjeev Arora |
Publisher | Cambridge University Press |
Total 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.
Computational Complexity and Recursion Theory
Title | Computational Complexity and Recursion Theory PDF eBook |
Author | University of Maryland at College Park. Computer Science Center |
Publisher | |
Total Pages | |
Release | 1979 |
Genre | |
ISBN |
Recursion Theory and Computational Complexity
Title | Recursion Theory and Computational Complexity PDF eBook |
Author | G. Lolli |
Publisher | Springer |
Total Pages | 236 |
Release | 2010-11-30 |
Genre | Mathematics |
ISBN | 9783642110719 |
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.
The Foundations of Computability Theory
Title | The Foundations of Computability Theory PDF eBook |
Author | Borut Robič |
Publisher | Springer |
Total Pages | 341 |
Release | 2015-09-14 |
Genre | Computers |
ISBN | 3662448084 |
This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism; in Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability; in Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science.