scientific article; zbMATH DE number 3586480

zbMATH Open0376.68027MaRDI QIDQ4153600FDOQ4153600

Authors:

Publication date: 1978

Title of this publication is not available (Why is that?)

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Computability and recursion theory (03Dxx)

Cited In (only showing first 100 items - show all)

On Goles' universal machines: a computational point of view
Set-driven and rearrangement-independent learning of recursive languages
A note on A.E. h-complex functions
Program size restrictions in computational learning
Elementary realizability
Learning in the presence of partial explanations
On p-creative sets and p-completely creative sets
Program self-reference in constructive Scott subdomains
Program self-reference in constructive Scott subdomains
On recursive bounds for the exceptional values in speed-up
Characterizing programming systems allowing program self-reference
The synthesis of language learners.
Variations on U-shaped learning
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
Characterization of realizable space complexities
Query languages for bags and aggregate functions
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
Infinitary self-reference in learning theory
How rich is the structure of the intrinsic complexity of learning
Decision problems of object histories
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
How to prove representation-independent independence results
The independence of control structures in abstract programming systems
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
Computation, hypercomputation, and physical science
Informal versus formal mathematics
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
More complicated questions about maxima and minima, and some closures of NP
Undecidability and incompleteness in classical mechanics
Memory limited inductive inference machines
Ordinal mind change complexity of language identification
Title not available (Why is that?)
Training sequences
Reductions among polynomial isomorphism types
Honest polynomial degrees and \(P=?NP\)
Iterative learning from positive data and negative counterexamples
Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
Finiteness and computation in toposes
Learning multiple languages in groups
Polynomials and linear transformations
Comparison of identification criteria for machine inductive inference
Diagonalization, uniformity, and fixed-point theorems
Probabilistic inductive inference: A survey
Generality's price: Inescapable deficiencies in machine-learned programs
Almost-everywhere complexity hierarchies for nondeterministic time
The complexity of the word problems for commutative semigroups and polynomial ideals
On the relative sizes of learnable sets
Prudence in vacillatory language identification
Probabilistic and team PFIN-type learning: General properties
Taming teams with mind changes
On the complexity-relativized strong reducibilities
Acceptable functional programming systems
Maximal machine learnable classes
Measuring the tameness of almost convex groups
Language learning from texts: Degrees of intrinsic complexity and their characterizations
Learning and extending sublanguages
On the inference of approximate programs
One-sided error probabilistic inductive inference and reliable frequency identification
Generalization versus classification
Independence results in computer science?
Anomalous learning helps succinctness
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
Trade-off among parameters affecting inductive inference
Cellular automata universality revisited
Learning by the process of elimination
On learning of functions refutably.
Learning in the presence of inaccurate information
Effective category and measure in abstract complexity theory
Defining effectiveness using finite sets. A study on computability
On a generalized notion of mistake bounds
The functions of finite support: a canonical learning problem
The \(\exists^*\forall^*\) part of the theory of ground term algebra modulo an AC symbol is undecidable.
Reflecting and self-confident inductive inference machines
Application of kolmogorov complexity to inductive inference with limited memory
Intrinsic complexity of learning geometrical concepts from positive data
Deciding Koopman's qualitative probability
In Scott-Strachey style denotational semantics, parallelism implies nondeterminism
Grammar directed gödel numberings
Learning how to separate.
Measure, category and learning theory
Spatial/kinematic domain and lattice computers
Efficient unidimensional universal cellular automaton
On the inductive inference of recursive real-valued functions
Isotopy in surface complexes from the computational viewpoint
Remarks on recursion versus diagonalization and exponentially difficult problems
Composition is almost (but not quite) as good as \(s-1-1\)
Strong noncomputability of random strings
A note on the complexity of program evaluation
A relation between correctness and randomness in the computation of probabilistic algorithms
Machine induction without revolutionary paradigm shifts
Simulating teams with many conjectures
A complexity measure for data flow models
Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets

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)