Notre Dame Journal of Formal Logic

A note on arbitrarily complex recursive functions.

Carl H. Smith

Full-text: Open access

Article information

Source
Notre Dame J. Formal Logic Volume 29, Number 2 (1988), 198-207.

Dates
First available in Project Euclid: 27 August 2004

Permanent link to this document
http://projecteuclid.org/euclid.ndjfl/1093637869

Zentralblatt MATH identifier
0651.03032

Mathematical Reviews number (MathSciNet)
MR939949

Digital Object Identifier
doi:10.1305/ndjfl/1093637869

Subjects
Primary: 03D15: Complexity of computation (including implicit computational complexity) [See also 68Q15, 68Q17]
Secondary: 68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.) [See also 03D15, 68Q17, 68Q19]

Citation

Smith, Carl H. A note on arbitrarily complex recursive functions. Notre Dame Journal of Formal Logic 29 (1988), no. 2, 198--207. doi:10.1305/ndjfl/1093637869. http://projecteuclid.org/euclid.ndjfl/1093637869.


Export citation