Cambridge University Press (1996)

Abstract
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.
Keywords Recursion theory
Categories (categorize this paper)
Buy the book $50.00 used (14% off)   $54.98 new (5% off)    Amazon page
Call number QA9.6.C66 1996
ISBN(s) 0521557364   9780521557368
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,241
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
Chapters BETA

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
26 ( #373,722 of 2,325,148 )

Recent downloads (6 months)
1 ( #671,788 of 2,325,148 )

How can I increase my downloads?

Downloads

My notes