scientific article; zbMATH DE number 3420728

MaRDI QIDQ5685065zbMATH OpenFDO

Authors Ja. M. Barzdin', Rūsiņš Freivalds

Publication date 1972

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory (03D99) Analysis of algorithms and problem complexity (68Q25)

Cited in

(38)

• Universal forecasting algorithms
• Model discrimination using an algorithmic information criterion
• Probabilistic language learning under monotonicity constraints
• Language learning from texts: Degrees of intrinsic complexity and their characterizations
• Trade-off among parameters affecting inductive inference
• On learning unions of pattern languages and tree patterns in the mistake bound model.
• The synthesis of language learners.
• Apple tasting.
• On-line learning with linear loss constraints.
• On a generalized notion of mistake bounds
• Intrinsic complexity of learning geometrical concepts from positive data
• Counting extensional differences in BC-learning
• On the complexity of function learning
• Absolutely no free lunches!
• Invertible classes
• Computability-theoretic learning complexity
• Active online learning in the binary perceptron problem
• Prediction of Recursive Real-Valued Functions from Finite Examples
• Mind change speed-up for learning languages from positive data
• scientific article; zbMATH DE number 605140 (Why is no real title available?)
• Inductive inference of recursive functions: complexity bounds
• What circuit classes can be learned with non-trivial savings?
• Simple and fast algorithms for interactive machine learning with random counter-examples
• Comparison of identification criteria for machine inductive inference
• A comparison of identification criteria for inductive inference of recursive real-valued functions
• Closedness properties in ex-identification
• Simulating teams with many conjectures
• Secretive interaction. Players and strategies
• Diagonalization Games
• Mechanical turkeys
• Prediction-preserving reducibility
• On the power of probabilistic strategies in inductive inference
• A non-learnable class of E-pattern languages
• Learning recursive functions: A survey
• Learning indexed families of recursive languages from positive data: A survey
• Taming teams with mind changes
• Consistent and coherent learning with \(\delta \)-delay
• Short proofs for online multiclass prediction on graphs

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 Q5685065)