Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH
Open Access
- 1 November 2003
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 90, 3-14
- https://doi.org/10.1016/s1571-0661(03)00005-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The expressive power of higher-order types or, life without CONSJournal of Functional Programming, 2001
- Metafinite Model TheoryInformation and Computation, 1998
- Descriptive complexity theory over the real numbersPublished by Association for Computing Machinery (ACM) ,1995
- Finite Automata and Logic: A Microcosm of Finite Model TheoryPublished by Springer Nature ,1995
- Accessible telephone directoriesThe Journal of Symbolic Logic, 1994
- A new recursion-theoretic characterization of the polytime functionscomputational complexity, 1992
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989