Classical Recursion Theory, Volume II (Studies in Logic and the Foundations of Mathematics)
Publisher: North Holland
Published: September 1, 1999
Language: eng
Number of pages: 966
ISBN-13: 9780444502056
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).