Show
Sort by
-
- Journal Article
- A1
- open access
Setting-up early computer programs: D. H. Lehmer's ENIAC computation
-
Characterizing the elementary recursive functions by a fragment of Godel's T
-
Bounding derivation lengths with functions from the slow growing hierarchy
-
A proof of strongly uniform termination for Godel's T by methods from local predicativity
-
A term rewriting characterization of the polytime functions and related complexity classes
-
Investigations on slow versus fast growing : how to majorize slow growing functions nontrivially by fast growing ones
-
Vereinfachte Kollabierungsfunktionen und ihre Anwendungen