The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book provide a picture of current ideas and methods in the ongoing investigations into the structure of the computable and noncomputable universe. A number of the articles contain introductory and background material that will make the volume an invaluable resource for mathematicians and computer scientists.
Book Description
Editorial Reviews
Book Description
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this text provide a picture of current ideas and methods in investigations into the structure of the computable and noncomputable universe.
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
The finite extension method is a central diagonalization technique in computability theory (see e.g. [Ro67], [Od89], [So87]). Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
genericity concepts, general genericity, slow diagonalizations, cupping property, capping interval, finite extension argument, very strong array, exponential time sets, array nonrecursive, genericity notions, enumerable degrees, innermost atoms, abstract category concept, partial lattices, total recursive functions, diagonalization step, finite variants, nonrecursive sets, critical triples, recursive enumeration, generic degree, lattice embeddings, arithmetical complexity, coding condition, upper semilattice Key Phrases - Capitalized Phrases (CAPs): (learn more)
Journal of Symbolic Logic, New York, Springer Verlag, Lecture Notes, Mathematical Logic, Annals of Mathematics, Fixed-Point Theorem, London Math, Notes Comput, Separation Theorem, Classical Recursion Theory, Complexity Theory Conference, Cornell University, First Recursion Theorem, Logic Colloquium, North Holland, Cambridge University Press, Ideal Definability Lemma, Non-Diamond Theorem, Doctoral Dissertation, Duke Math, Logik Grundlagen Math, Pure Appl, University of Chicago New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
The finite extension method is a central diagonalization technique in computability theory (see e.g. [Ro67], [Od89], [So87]). Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
genericity concepts, general genericity, slow diagonalizations, cupping property, capping interval, finite extension argument, very strong array, exponential time sets, array nonrecursive, genericity notions, enumerable degrees, innermost atoms, abstract category concept, partial lattices, total recursive functions, diagonalization step, finite variants, nonrecursive sets, critical triples, recursive enumeration, generic degree, lattice embeddings, arithmetical complexity, coding condition, upper semilattice Key Phrases - Capitalized Phrases (CAPs): (learn more)
Journal of Symbolic Logic, New York, Springer Verlag, Lecture Notes, Mathematical Logic, Annals of Mathematics, Fixed-Point Theorem, London Math, Notes Comput, Separation Theorem, Classical Recursion Theory, Complexity Theory Conference, Cornell University, First Recursion Theorem, Logic Colloquium, North Holland, Cambridge University Press, Ideal Definability Lemma, Non-Diamond Theorem, Doctoral Dissertation, Duke Math, Logik Grundlagen Math, Pure Appl, University of Chicago New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 15
books:
See all 15 books this book cites
6
books
cite this book:
See all 6 books citing this book
- Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 1 (Studies in Logic and the Foundations of Mathematics, Vol. 125) by Piergiorgio Odifreddi on 4 pages
- Recursion Theory (Proceedings of Symposia in Pure Mathematics) by Anil Nerode on page 79, page 181, and page 232
- Mathematical Logic (Dover Books on Mathematics) by Stephen Cole Kleene on page 92, page 203, and page 256
- Theory of Recursive Functions and Effective Computability by Hartley Rogers on page 232, and page 311
- Mathematical Logic by Joseph R. Shoenfield on page 203, and page 331
See all 15 books this book cites
- Computability Theory (Chapman Hall/CRC Mathematics Series) by S. Barry Cooper in Back Matter (1), and Back Matter (2)
- Reverse Mathematics 2001: Lecture Notes in Logic 21 by Stephen G. Ross on page 377
- Handbook of Computability Theory, Volume 140 (Studies in Logic and the Foundations of Mathematics) by E.R. Griffor on page 146
- Reverse Mathematics 2001 (Lecture Notes in Logic) by Stephen G. Ross on page 377
- Logic Colloquium '98: Lecture Notes in Logic 13 by Sam Buss on page 24
See all 6 books citing this book
Books on Related Topics
(learn more)
|
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
