Home » Mathematical Theory of Computation » Complexity, Logic, and Recursion Theory
Product Image
Andrea Sorbi

Complexity, Logic, and Recursion Theory

★★★★★
★★★★★
€297.60
A01=Andrea Sorbi
Augmenting Path
Author_Andrea Sorbi
Category=PBCD
Category=PBW
Category=UYA
Combinatorial Reduction
complexity theoretic approach
Degree Structure
Distributive Continuous Lattice
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_non-fiction
Heyting Algebra
Jump Class
Kolmogorov Complexity
mathematical logic
Oracle Turing Machines
Order Arithmetic
Partial Recursive Function
Primitive Recursive Functions
recursion theoretic approach
Recursive Function
Recursive Sequence
Recursively Enumerable
Remove Neighborhood
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
Delivery/Collection within 10-20 working days

Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock

10-20 Working Days: On Backorder

Will Deliver When Available: On Pre-Order or Reprinting

We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!

Description
"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."
About Andrea Sorbi
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.