scientific article; zbMATH DE number 605140
From MaRDI portal
Publication:4300060
zbMath0819.68052MaRDI QIDQ4300060
Suzanne Ngo Manguelle, Sanjay Jain, John Case
Publication date: 8 September 1994
Full work available at URL: https://eudml.org/doc/27660
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
On learning of functions refutably. ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Enlarging learnable classes ⋮ On the power of recursive optimizers ⋮ On the classification of recursive languages ⋮ Machine induction without revolutionary paradigm shifts ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Learning how to separate. ⋮ Robust learning with infinite additional information ⋮ Costs of general purpose learning ⋮ Increasing the power of uniform inductive learners ⋮ Comparison of identification criteria for machine inductive inference ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Unnamed Item ⋮ Learning with refutation ⋮ Maximal machine learnable classes ⋮ On a generalized notion of mistake bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A connotational theory of program structure
- Comparison of identification criteria for machine inductive inference
- On the error correcting power of pluralism in BC-type inductive inference
- Probability and plurality for aggregations of learning machines
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- The independence of control structures in abstract programming systems
- Some natural properties of strong-identification in inductive inference
- Composition is almost (but not quite) as good as \(s-1-1\)
- Gödel numberings of partial recursive functions
- The Power of Pluralism for Automatic Program Synthesis
- Periodicity in generations of automata
- Toward a mathematical theory of inductive inference
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
This page was built for publication:
