Publication:4310702
From MaRDI portal
zbMath0813.03023MaRDI QIDQ4310702
Publication date: 1 November 1994
independence; efficiency; complexity theory; recursive function; succinctness; program-size trade-offs; subrecursive programming systems
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03D15: Complexity of computation (including implicit computational complexity)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03D80: Applications of computability and recursion theory
Related Items
Synthesizing learners tolerating computable noisy data, Control structures in hypothesis spaces: The influence on learning, Topological separations in inductive inference, A map of update constraints in inductive inference, Strongly non-U-shaped language learning results by general techniques, Iterative learning from positive data and counters, Hypothesis spaces for learning, Anomalous learning helps succinctness, A learning-theoretic characterization of classes of recursive functions, Learning in the limit with lattice-structured hypothesis spaces, Characterizing programming systems allowing program self-reference, Resource restricted computability theoretic learning: Illustrative topics and problems, Inferring answers to queries, Maximal machine learnable classes, Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals, On the computational complexity of Longley's \(H\) functional, Learning secrets interactively. Dynamic modeling in inductive inference, A solution to Wiehagen's thesis, Generality's price: Inescapable deficiencies in machine-learned programs, Rice and Rice-Shapiro Theorems for transfinite correction grammars, Feasible Iteration of Feasible Learning Functionals, Dynamically Delayed Postdictive Completeness and Consistency in Learning, Dynamic Modeling in Inductive Inference, Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
