Format:
Online-Ressource
Edition:
Elsevier e-book collection on ScienceDirect
ISBN:
044450205X
,
9780444502056
Series Statement:
Studies in logic and the foundations of mathematics 143
Content:
Volume II of 〈IT〉Classical Recursion Theory〈/IT〉 describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from small time and space bounds to the elementary functions, with a particular attention to polynomial time and space computability. It also deals with primitive recursive functions and larger classes, which are of interest to the proof theorist. The second half of the book starts with the classical theory of recursively enumerable sets and degrees, which constitutes the core of Recursion or Computability Theory. Unlike other texts, usually confined to the Turing degrees, the book covers a variety of other strong reducibilities, studying both their individual structures and their mutual relationships. The last chapters extend the theory to limit sets and arithmetical sets. The volume ends with the first textbook treatment of the enumeration degrees, which admit a number of applications from algebra to the Lambda Calculus. The book is a valuable source of information for anyone interested in Complexity and Computability Theory. The student will appreciate the detailed but informal account of a wide variety of basic topics, while the specialist will find a wealth of material sketched in exercises and asides. A massive bibliography of more than a thousand titles completes the treatment on the historical side
Note:
Vol. 2 lacks other title information. - "First edition 1999"--V. 2, t.p. verso. - Vol. 2 published: Amsterdam ; New York : Elsevier. - Includes bibliographical references and indexes. - Print version record
,
"First edition 1999"--V. 2, t.p. verso
,
Vol. 2 published: Amsterdam ; New York : Elsevier
,
Includes bibliographical references and indexes
,
Print version record
,
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002
Additional Edition:
ISBN 0444872957
Additional Edition:
ISBN 9780444872951
Additional Edition:
Erscheint auch als Druck-Ausgabe Odifreddi, Piergiorgio, 1950 - Classical recursion theory ; Vol. 2 Amsterdam [u.a.] : Elsevier, 1999 ISBN 044450205X
Language:
English
Subjects:
Mathematics
Keywords:
Rekursionstheorie
;
Electronic books
;
Electronic books
URL:
Volltext
(lizenzpflichtig)
