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 functions; relative computability

Mathematics Subject Classification ID

03D20: Recursive functions and relations, subrecursive hierarchies

68W99: Algorithms in computer science

03D60: Computability and recursion theory on ordinals, admissible sets, etc.