scientific article; zbMATH DE number 680708

zbMath0813.03023MaRDI QIDQ4310702

James S. Royer, John Case

Publication date: 1 November 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

independenceefficiencycomplexity theoryrecursive functionsuccinctnessprogram-size trade-offssubrecursive programming systems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Applications of computability and recursion theory (03D80)

Related Items (27)

A solution to Wiehagen's thesis ⋮ Generality's price: Inescapable deficiencies in machine-learned programs ⋮ A map of update constraints in inductive inference ⋮ Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals ⋮ Strongly non-U-shaped language learning results by general techniques ⋮ Iterative learning from positive data and counters ⋮ Learning secrets interactively. Dynamic modeling in inductive inference ⋮ Feasible Iteration of Feasible Learning Functionals ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Dynamic Modeling in Inductive Inference ⋮ Inferring answers to queries ⋮ Anomalous learning helps succinctness ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ Hypothesis spaces for learning ⋮ Synthesizing learners tolerating computable noisy data ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Learnability and positive equivalence relations ⋮ Control structures in hypothesis spaces: The influence on learning ⋮ Topological separations in inductive inference ⋮ Characterizing programming systems allowing program self-reference ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Rice and Rice-Shapiro Theorems for transfinite correction grammars ⋮ Difficulties in Forcing Fairness of Polynomial Time Inductive Inference ⋮ On the computational complexity of Longley's \(H\) functional ⋮ Maximal machine learnable classes ⋮ Towards a map for incremental learning in the limit from positive and negative information ⋮ Learning languages in the limit from positive information with finitely many memory changes

This page was built for publication: