Axiomatic approach to the theory of algorithms and relativized computability

zbMath0465.68015arXiv1811.06259MaRDI QIDQ1154802

S. H. Smith

Publication date: 1980

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.06259

zbMATH Keywords

partial functionsrelative computability

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)

This page was built for publication: Axiomatic approach to the theory of algorithms and relativized computability