Complexity, Logic, and Recursion Theory
Regular price
€328.60
14 days return policy
Shipping & Delivery
A01=Andrea Sorbi
advanced recursion theory applications
algebraic structures
Augmenting Path
Author_Andrea Sorbi
bounded arithmetic
Category=PBCD
Category=PBW
Category=UYA
Combinatorial Reduction
complexity theoretic approach
computability theory
Degree Structure
Distributive Continuous Lattice
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Heyting Algebra
inductive inference
Jump Class
Kolmogorov Complexity
local search algorithms
mathematical logic
Oracle Turing Machines
Order Arithmetic
Partial Recursive Function
Primitive Recursive Functions
recursion theoretic approach
Recursive Function
Recursive Sequence
Recursively Enumerable
Remove Neighborhood
resource-bounded randomness
Tile Types
Tiling Problem
Time Space Diagram
Turing Degrees
Turing Machine
Turing Machine Computations
Universal Machine
Universal Turing Machine
Vertex Cover
Witness Scheme
Product details
- ISBN 9780824700263
- Weight: 635g
- Dimensions: 210 x 280mm
- Publication Date: 04 Feb 1997
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
"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."
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.
