A Machine-Independent Theory of the Complexity of Recursive Functions

Cited in

(only showing first 100 items - show all)

On centain decompositions of Gödel numberings
Sequential fuzzy system identification
Type 2 recursion theory
ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
Strategies for managing the structural and dynamic consequences of project complexity
Approximation to measurable functions and its relation to probabilistic computation
Complexity-class-encoding sets
scientific article; zbMATH DE number 702378 (Why is no real title available?)
``Natural properties of flowchart step-counting measures
A note on A.E. h-complex functions
Martin Davis and Hilbert's tenth problem
Komplexität von Algorithmen mit Anwendung auf die Analysis
Constructivity conditions on immune sets
A note on the diagonalizable algebras of PA and ZF
Speed-up theorems in type-2 computations using oracle Turing machines
Kolmogorov numberings and minimal identification
Intensional Kleene and Rice theorems for abstract program semantics
On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
Program size restrictions in computational learning
Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems
scientific article; zbMATH DE number 3473353 (Why is no real title available?)
On the inference of optimal descriptions
Some applications of the McCreight-Meyer algorithm in abstract complexity theory
The complexity of total order structures
Learning in the presence of partial explanations
Costs of general purpose learning
Factorizing RSA keys, an improved analogue solution
Complexity properties of recursively enumerable sets and bsQ-completeness
Program self-reference in constructive Scott subdomains
Expressing computational complexity in constructive type theory
Instability, complexity, and evolution
Characterizing language identification by standardizing operations
On recursive bounds for the exceptional values in speed-up
Characterizing programming systems allowing program self-reference
Computational complexity of real functions
Tape-reversal bounded Turing machine computations
Finite approximate approach to the study of the complexity of recursive predicates
Reflecting and self-confident inductive inference machines
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
Machine learning of higher-order programs
Ideal presentations and numberings of some classes of effective quasi-Polish spaces
On the Weihrauch degree of the additive Ramsey theorem
On the first-order parts of problems in the Weihrauch degrees
The 1982 ACM Turing Award lecture. An overview of computational complexity
Aggregating inductive expertise on partial recursive functions
Iterative learning from texts and counterexamples using additional information
The intrinsic difficulty of recursive functions
Reversible parallel computation: An evolving space-model
The structure of intrinsic complexity of learning
The synthesis of language learners.
Subrecursive equivalence relations and (non-)closure under lattice operations
On some open problems in reflective inductive inference
On subcreative sets and S-reducibility
On degrees of unsolvability and complexity properties
Variations on U-shaped learning
Oracle Quantum Computing
1998–1999 Winter Meeting of the Association for Symbolic Logic
Intrinsic complexity of learning geometrical concepts from positive data
Learning-theoretic perspectives of acceptable numberings
A universal cellular automaton in quasi-linear time and its S-m-n form
Learning indexed families of recursive languages from positive data: A survey
On the power of recursive optimizers
U-shaped, iterative, and iterative-with-counter learning
Aspects of complexity of probabilistic learning under monotonicity constraints
On the structure of subrecursive degrees
Imperative process algebra and models of parallel computation
Total complexity and the inference of best programs
Nonexistence of program optimizers in several abstract settings
Characterization of realizable space complexities
Accepting networks of genetic processors are computationally complete
Computability-theoretic learning complexity
Unconventional complexity measures for unconventional computers
scientific article; zbMATH DE number 3305096 (Why is no real title available?)
Complexity properties of recursively enumerable sets and sQ-completeness
Reverse complexity
Two recursion theoretic characterizations of proof speed-ups
Some natural properties of strong-identification in inductive inference
Learning how to separate.
On the learnability of recursively enumerable languages from good examples
Learning in Friedberg numberings
Control structures in hypothesis spaces: The influence on learning
Learning languages from positive data and negative counterexamples
Augmented loop languages and classes of computable functions
On the density of honest subrecursive classes
Gold-style learning theory. A selection of highlights since Gold
Mechanical turkeys
Polynomial and abstract subrecursive classes
Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles
scientific article; zbMATH DE number 3619885 (Why is no real title available?)
Parsimony hierarchies for inductive inference
Classes of recursively enumerable sets and Q-reducibility
PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part I: Dynamic Complexity
PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part II: Static Complexity
Exact Pairs for Abstract Bounded Reducibilities
The independence of control structures in abstract programming systems
Infinitary self-reference in learning theory
Data representation and computational complexity
Complexity classes of provable recursive functions
On restricted turing computability
Bi-immunity over different size alphabets

This page was built for publication: A Machine-Independent Theory of the Complexity of Recursive Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5537605)