Check nearby libraries
Buy this book
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
Showing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
Classical Recursion Theory (Studies in Logic and the Foundations of Mathematics)
October 1, 1999, North Holland
in English
0444894837 9780444894830
|
aaaa
Libraries near you:
WorldCat
|
Book Details
First Sentence
"As a first approximation, we introduce static complexity measures in an abstract way as follows: given an acceptable system of indices {e}e for the partial recursive functions (see II.5.2), we call a static complexity measure any total recursive function m, and call complexity or size of e the number m(e)."
ID Numbers
Community Reviews (0)
Feedback?History
- Created April 29, 2008
- 7 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
April 6, 2014 | Edited by ImportBot | Added IA ID. |
August 6, 2010 | Edited by IdentifierBot | added LibraryThing ID |
April 24, 2010 | Edited by Open Library Bot | Fixed duplicate goodreads IDs. |
April 16, 2010 | Edited by bgimpertBot | Added goodreads ID. |
April 29, 2008 | Created by an anonymous user | Imported from amazon.com record. |