A note on “axioms” for computational complexity and computation of finite functions

DOI10.1016/S0019-9958(71)90651-6zbMath0256.68014OpenAlexW1978536611WikidataQ114656784 ScholiaQ114656784MaRDI QIDQ5671620

Paul D. Young

Publication date: 1972

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(71)90651-6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Syntax and semantics of universal programming languages

This page was built for publication: A note on “axioms” for computational complexity and computation of finite functions