Classical Recursion Theory (Studies in Logic and the Foundations of Mathematics)

  • 1 Want to read
Locate

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 1 Want to read

Buy this book

Last edited by Open Library Bot
April 28, 2010 | History

Classical Recursion Theory (Studies in Logic and the Foundations of Mathematics)

  • 1 Want to read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
North Holland
Language
English
Pages
692

Buy this book

Previews available in: English

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

Open Library
OL7533865M
Internet Archive
classicalrecursi00odif
ISBN 10
0444894837
ISBN 13
9780444894830
Library Thing
7197248
Goodreads
923516

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
April 28, 2010 Edited by Open Library Bot Linked existing covers to the work.
December 10, 2009 Created by WorkBot add works page