scientific article; zbMATH DE number 680708
From MaRDI portal
Publication:4310702
complexity theoryefficiencyindependenceprogram-size trade-offsrecursive functionsubrecursive programming systemssuccinctness
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Recommendations
- scientific article; zbMATH DE number 2079037
- Subroutines in P systems and closure properties of their complexity classes
- scientific article; zbMATH DE number 3845026
- scientific article; zbMATH DE number 3841833
- scientific article; zbMATH DE number 1130215
- Finitely recursive programs: decidability and bottom-up computation
- scientific article; zbMATH DE number 785053
- On finitely recursive programs
- On Finitely Recursive Programs
- Sub-Turing reducibilities of restricted complexity
Cited in
(31)- 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
- 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
- A solution to Wiehagen's thesis
- Generality's price: Inescapable deficiencies in machine-learned programs
- Rice and Rice-Shapiro theorems for transfinite correction grammars
- A map of update constraints in inductive inference
- Strongly non-U-shaped language learning results by general techniques
- 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
- Iterative learning from positive data and counters
- scientific article; zbMATH DE number 598180 (Why is no real title available?)
- scientific article; zbMATH DE number 2079037 (Why is no real title available?)
- Hypothesis spaces for learning
- A connotational theory of program structure
- Synthesizing learners tolerating computable noisy data
- Control structures in hypothesis spaces: The influence on learning
- Topological separations in inductive inference
- Learnability and positive equivalence relations
- Anomalous learning helps succinctness
- A learning-theoretic characterization of classes of recursive functions
- Constructivity conditions on immune sets
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4310702)
