Skip to main content
Conference Proceedings

Recursion in higher types and resource bounded turing machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5028 LNCS 336-348
DOI: 10.1007/978-3-540-69407-6_37
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that neat and natural fragments of Gödel's and Plotkin's capture complexity classes defined by imposing resource bounds on Turing machines. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kristiansen, L. (2008). Recursion in higher types and resource bounded turing machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5028 LNCS, pp. 336–348). https://doi.org/10.1007/978-3-540-69407-6_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free