Complexity, Logic, and Recursion Theory
"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."
1128483478
Complexity, Logic, and Recursion Theory
"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."
243.99 In Stock
Complexity, Logic, and Recursion Theory

Complexity, Logic, and Recursion Theory

by Andrea Sorbi
Complexity, Logic, and Recursion Theory

Complexity, Logic, and Recursion Theory

by Andrea Sorbi

eBook

$243.99  $325.00 Save 25% Current price is $243.99, Original price is $325. You Save 25%.

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

"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."

Product Details

ISBN-13: 9780429529955
Publisher: CRC Press
Publication date: 05/07/2019
Series: Lecture Notes in Pure and Applied Mathematics
Sold by: Barnes & Noble
Format: eBook
Pages: 380
File size: 25 MB
Note: This product may take a few minutes to download.

About the Author

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.

Table of Contents

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).
From the B&N Reads Blog

Customer Reviews