| Publication | Date of Publication | Type |
|---|
Systems that learn. An introduction to learning theory for cognitive and computer scientists
Learning, Development, and Conceptual Change | 2025-04-16 | Paper |
Adventures in time and space
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2017-08-21 | Paper |
Program size complexity of correction grammars in the Ershov hierarchy
Pursuit of the Universal | 2016-08-17 | Paper |
Axiomatizing resource bounds for measure
Models of Computation in Context | 2011-09-09 | Paper |
Generality's price. Inescapable deficiencies in machine-learned programs
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Two algorithms in search of a type-system
Theory of Computing Systems | 2009-10-19 | Paper |
Time-Complexity Semantics for Feasible Affine Recursions
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Adventures in time and space
Logical Methods in Computer Science | 2007-10-11 | Paper |
Generality's price: Inescapable deficiencies in machine-learned programs
Annals of Pure and Applied Logic | 2006-04-28 | Paper |
Every polynomial-time 1-degree collapses if and only if P = PSPACE
Journal of Symbolic Logic | 2005-08-29 | Paper |
On the computational complexity of Longley's \(H\) functional
Theoretical Computer Science | 2004-08-06 | Paper |
On characterizations of the basic feasible functionals. I
Journal of Functional Programming | 2002-09-11 | Paper |
| scientific article; zbMATH DE number 1241371 (Why is no real title available?) | 1999-08-31 | Paper |
A hierarchy based on output multiplicity
Theoretical Computer Science | 1999-01-12 | Paper |
The isomorphism conjecture fails relative to a random oracle
Journal of the ACM | 1998-02-02 | Paper |
| scientific article; zbMATH DE number 1072534 (Why is no real title available?) | 1997-10-08 | Paper |
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
Journal of Computer and System Sciences | 1997-08-03 | Paper |
On closure properties of bounded two-sided error complexity classes
Mathematical Systems Theory | 1995-12-13 | Paper |
| scientific article; zbMATH DE number 680708 (Why is no real title available?) | 1994-11-01 | Paper |
On 1-truth-table-hard languages
Theoretical Computer Science | 1993-10-03 | Paper |
Two recursion theoretic characterizations of proof speed-ups
Journal of Symbolic Logic | 1989-01-01 | Paper |
Collapsing degrees
Journal of Computer and System Sciences | 1988-01-01 | Paper |
A connotational theory of program structure
Lecture Notes in Computer Science | 1987-01-01 | Paper |
How to prove representation-independent independence results
Information Processing Letters | 1987-01-01 | Paper |
Inductive inference of approximations
Information and Control | 1986-01-01 | Paper |
