Abstract Recursion and Intrinsic Complexity

DOI10.1017/9781108234238zbMath1412.03004OpenAlexW2901836161MaRDI QIDQ4690192

Yiannis N. Moschovakis

Publication date: 22 October 2018

Full work available at URL: https://doi.org/10.1017/9781108234238

zbMATH Keywords

complexityalgorithmuniform processrecursive programabstract recursionhomomorphism methodMcCarthy program

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (2)

Unnamed Item ⋮ A Behavioural Theory of Recursive Algorithms

This page was built for publication: Abstract Recursion and Intrinsic Complexity