Predicative Analysis of Feasibility and Diagonalization

DOI10.1007/978-3-540-73228-0_21zbMath1215.03055MaRDI 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

03D15: Complexity of computation (including implicit computational complexity)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03D20: Recursive functions and relations, subrecursive hierarchies

03B40: Combinatory logic and lambda calculus

Related Items

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