Predicative Analysis of Feasibility and Diagonalization

DOI10.1007/978-3-540-73228-0_21zbMath1215.03055OpenAlexW1542130190MaRDI QIDQ3612638

Jean-Yves Marion

Publication date: 10 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73228-0_21

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Recursion Schemata for NC k ⋮ Linear logic by levels and bounded time complexity

This page was built for publication: Predicative Analysis of Feasibility and Diagonalization