Programmkomplexität von berechenbaren Funktionen

DOI10.1002/ZAMM.19700500140zbMath0205.01305OpenAlexW2143947710MaRDI QIDQ5604468

Jiří Bečvář

Publication date: 1970

Published in: ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/zamm.19700500140

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

Complexity of algorithms and computations

Cites Work

• Gödel numberings of partial recursive functions
• On the size of machines

This page was built for publication: Programmkomplexität von berechenbaren Funktionen