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

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Not in Library

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

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by Camillo Pellizzari
February 2, 2020 | History

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

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

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

Publish Date
Publisher
North Holland
Language
English
Pages
966

Buy this book

Edition Availability
Cover of: Classical Recursion Theory, Volume II (Studies in Logic and the Foundations of Mathematics)

Add another edition?

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
OL7530365M
ISBN 10
044450205X
ISBN 13
9780444502056
Library Thing
1713162
Goodreads
4457056

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
February 2, 2020 Edited by Camillo Pellizzari merge authors
April 28, 2010 Edited by Open Library Bot Linked existing covers to the work.
December 10, 2009 Created by WorkBot add works page