Computation models and function algebras
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 61 references indexed in Scilit:
- Function-algebraic characterizations of log and polylog parallel timecomputational complexity, 1994
- Subrecursive hierarchies on Scott domainsArchive for Mathematical Logic, 1993
- A time-space hierarchy between polynomial time and polynomial spaceTheory of Computing Systems, 1992
- A new recursion-theoretic characterization of the polytime functionscomputational complexity, 1992
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- Subrecursiveness: Machine-independent notions of computability in restricted time and storageTheory of Computing Systems, 1972
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik, 1931
- Über das UnendlicheMathematische Annalen, 1926