Complexity, Logic, and Recursion Theory

1. Auflage 1997
ISBN: 978-0-8247-0026-3
Verlag: Taylor & Francis

Buch, Englisch, 384 Seiten, Format (B × H): 210 mm x 280 mm, Gewicht: 635 g

Reihe: Lecture Notes in Pure and Applied Mathematics

"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."

Zielgruppe

Professional

Autoren/Hrsg.

Sorbi, Andrea

Fachgebiete

• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik

Inhaltsverzeichnis

Resource-bounded measure and randomness; degree structures in local degree theory; compressibility of infinite binary sequences; beyond Godel's theorem - the failure to capture information content; progressions of theories of bounded arithmetic; on presentations of algebraic structures; witness-isomorphic reductions and local search; a survey of inductive inference with an emphasis on queries; a uniformity of degree structures; short course on logic, algebra, and topology; the convenience of Tiling. (Part contents).

Über Autor(innen)

Andrea Sorbi is Associate Professor in the Department of Mathematics at the University of Siena, Italy. The author or coauthor of several key professional papers and book chapters on computability theory and mathematical logic, he is a member of the American Mathematical Society and the Association for Symbolic Logic, among other organizations. Dr. Sorbi received the Ph.D. degree (1987) in mathematics from the City University of New York, New York.