scientific article; zbMATH DE number 3586480
From MaRDI portal
Publication:4153600
Cited in
(only showing first 100 items - show all)- Generalization versus classification
- Anomalous learning helps succinctness
- Trade-off among parameters affecting inductive inference
- Learning by the process of elimination
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On learning of functions refutably.
- Cellular automata universality revisited
- Learning in the presence of inaccurate information
- Effective category and measure in abstract complexity theory
- Rice and Rice-Shapiro theorems for transfinite correction grammars
- Defining effectiveness using finite sets. A study on computability
- On Goles' universal machines: a computational point of view
- Bandwidth contrained NP-complete problems
- On a generalized notion of mistake bounds
- A note on A.E. h-complex functions
- Set-driven and rearrangement-independent learning of recursive languages
- The functions of finite support: a canonical learning problem
- Program size restrictions in computational learning
- Elementary realizability
- Learning in the presence of partial explanations
- On p-creative sets and p-completely creative sets
- The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable.
- Program self-reference in constructive Scott subdomains
- On recursive bounds for the exceptional values in speed-up
- Characterizing programming systems allowing program self-reference
- Program self-reference in constructive Scott subdomains
- Reflecting and self-confident inductive inference machines
- Application of kolmogorov complexity to inductive inference with limited memory
- The synthesis of language learners.
- Variations on U-shaped learning
- 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
- Monotonic and dual monotonic language learning
- Deciding Koopman's qualitative probability
- Characterization of realizable space complexities
- Query languages for bags and aggregate functions
- Learning how to separate.
- In Scott-Strachey style denotational semantics, parallelism implies nondeterminism
- Grammar directed gödel numberings
- A uniform method for proving lower bounds on the computational complexity of logical theories
- Learning languages from positive data and negative counterexamples
- On the learnability of vector spaces
- How rich is the structure of the intrinsic complexity of learning
- Measure, category and learning theory
- Decision problems of object histories
- How to prove representation-independent independence results
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
- The independence of control structures in abstract programming systems
- Infinitary self-reference in learning theory
- Spatial/kinematic domain and lattice computers
- On the inductive inference of recursive real-valued functions
- Efficient unidimensional universal cellular automaton
- Isotopy in surface complexes from the computational viewpoint
- On the intrinsic complexity of learning recursive functions
- Learning by switching type of information.
- Probability and plurality for aggregations of learning machines
- Indexings of subrecursive classes
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- Computation, hypercomputation, and physical science
- Informal versus formal mathematics
- More complicated questions about maxima and minima, and some closures of NP
- Remarks on recursion versus diagonalization and exponentially difficult problems
- Undecidability and incompleteness in classical mechanics
- Composition is almost (but not quite) as good as \(s-1-1\)
- A note on the complexity of program evaluation
- Strong noncomputability of random strings
- Memory limited inductive inference machines
- A relation between correctness and randomness in the computation of probabilistic algorithms
- Ordinal mind change complexity of language identification
- Training sequences
- Reductions among polynomial isomorphism types
- Honest polynomial degrees and \(P=?NP\)
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets
- A complexity measure for data flow models
- Iterative learning from positive data and negative counterexamples
- Machine induction without revolutionary paradigm shifts
- Simulating teams with many conjectures
- scientific article; zbMATH DE number 3839936 (Why is no real title available?)
- scientific article; zbMATH DE number 3839937 (Why is no real title available?)
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
- Index sets and presentations of complexity classes
- Learnability: admissible, co-finite, and hypersimple languages
- Polynomials and linear transformations
- Learning multiple languages in groups
- Comparison of identification criteria for machine inductive inference
- Finiteness and computation in toposes
- Diagonalization, uniformity, and fixed-point theorems
- Effective category and measure in abstract complexity theory
- Probabilistic inductive inference: A survey
- The complexity types of computable sets
- Generality's price: Inescapable deficiencies in machine-learned programs
- Almost-everywhere complexity hierarchies for nondeterministic time
- Probabilistic language learning under monotonicity constraints
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Minimum-complexity pairing functions
- On the relative sizes of learnable sets
- Probabilistic and team PFIN-type learning: General properties
- Taming teams with mind changes
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 Q4153600)
