Publication

1999-10-01 - North Holland

Language

English

Word Count

173,000 words, Guess

Page Count

692 pages

Identifiers

  • Internet Archiveclassicalrecursi00odif
  • ISBN-100444894837
  • ISBN-139780444894830
  • LibraryThing7197248
  • Goodreads923516
and 1 more

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).

Subjects

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!