Computability, Enumerability, Unsolvability Image close
Computability, Enumerability, Unsolvability
Computability, Enumerability, Unsolvability
Show Hide Adult Content
Computability, Enumerability, Unsolvability close

Non-Fiction Books:

Home  
Books  
Non-Fiction  
Maths & Science  
Mathematics  
Mathematical foundations  
Mathematical logic

Computability, Enumerability, Unsolvability

Directions in Recursion Theory
Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
$163.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $40.75 with Afterpay Learn more

6 weekly interest-free payments of $27.17 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 13-25 June using International Courier

Explore more London Mathematical Society Lecture Note Series,

See all products in this series

Forcing with Random Variables and Proof Complexity by Jan Krajicek
$166.00
Forcing with Random Variables and Proof Complexity
by Jan Krajicek ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Locally Presentable and Accessible Categories by J. Rosicky
$289.00
Locally Presentable and Accessible Categories
by J. Rosicky ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Stable Groups by F. Wagner
$196.00
Stable Groups
by F. Wagner ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Independence-Friendly Logic by Allen L. Mann
$216.00
Independence-Friendly Logic
by Allen L. Mann ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Synthetic Differential Topology by Marta Bunge
$211.00
Synthetic Differential Topology
by Marta Bunge ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Appalachian Set Theory
$211.00
Appalachian Set Theory
Paperback / softback
Available - Usually ships in 3-4 weeks
O-Minimality and Diophantine Geometry
$192.00
O-Minimality and Diophantine Geometry
Paperback / softback
Available - Usually ships in 3-4 weeks
The Logical Approach to Automatic Sequences by Jeffrey Shallit
$229.00
The Logical Approach to Automatic Sequences
by Jeffrey Shallit ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Boolean Function Complexity
$115.00
Boolean Function Complexity
Paperback / softback
Available - Usually ships in 3-4 weeks
Foundations of Computational Mathematics, Minneapolis 2002
$180.00
Foundations of Computational Mathematics, Minneapolis 2002
Paperback / softback
Available - Usually ships in 3-4 weeks
Complexity: Knots, Colourings and Countings by Dominic Welsh
$166.00
Complexity: Knots, Colourings and Countings
by Dominic Welsh ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Motivic Integration and its Interactions with Model Theory and Non-Archimedean Geometry: Volume 1
$228.00
Motivic Integration and its Interactions with Model Theory and...
Paperback / softback
Available - Usually ships in 3-4 weeks
Models and Computability
$184.00
Models and Computability
Paperback / softback
Available - Usually ships in 3-4 weeks
Sets and Proofs
$185.00
Sets and Proofs
Paperback / softback
Available - Usually ships in 3-4 weeks
Elliptic Curves in Cryptography by I. Blake
$221.00
Elliptic Curves in Cryptography
by I. Blake ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Model Theory of Groups and Automorphism Groups
$161.00
Model Theory of Groups and Automorphism Groups
Paperback / softback
Available - Usually ships in 3-4 weeks

Description

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource for specialists and non-specialists alike.
Release date NZ
January 11th, 1996
Audience
  • Professional & Vocational
Contributors
  • Edited by S.B. Cooper
  • Edited by S.S. Wainer
  • Edited by T. A. Slaman
Illustrations
Worked examples or Exercises
Pages
356
Dimensions
152x228x21
ISBN-13
9780521557368
Product ID
2160263

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Non-Fiction >
Maths & Science >
Mathematics >
Mathematical foundations >
Mathematical logic
Books >
Computers & Internet >
Theory & Design >
Mathematical theory of computation
Books >
Computers & Internet >
Computer science >
Mathematical theory of computation