scientific article
zbMath0519.68051MaRDI QIDQ3668865
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machinesconstructive mathematicsrecursive programsabstract computabilityrecursive definabilityarithmeticseffective computabilitycomputation processdiophantine computabilityoperational algorithmsprogram determinant
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Other constructive mathematics (03F65) Theory of numerations, effectively presented structures (03D45) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (2)
This page was built for publication: