Check nearby libraries
Buy this book
Last edited by Open Library Bot
April 28, 2010 | History
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
Edition | Availability |
---|---|
1
Classical Recursion Theory (Studies in Logic and the Foundations of Mathematics)
October 1, 1999, North Holland
in English
0444894837 9780444894830
|
aaaa
|
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?April 28, 2010 | Edited by Open Library Bot | Linked existing covers to the work. |
December 10, 2009 | Created by WorkBot | add works page |