scientific article; zbMATH DE number 3420728

zbMath0267.02029MaRDI QIDQ5685065

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

Publication date: 1972

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (35)

Intrinsic complexity of learning geometrical concepts from positive data ⋮ Counting extensional differences in BC-learning ⋮ What Circuit Classes Can Be Learned with Non-Trivial Savings? ⋮ Invertible classes ⋮ On the complexity of function learning ⋮ Inductive inference of recursive functions: Complexity bounds ⋮ Computability-theoretic learning complexity ⋮ Mind change speed-up for learning languages from positive data ⋮ Probabilistic language learning under monotonicity constraints ⋮ Simulating teams with many conjectures ⋮ Unnamed Item ⋮ Absolutely no free lunches! ⋮ Learning recursive functions: A survey ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Taming teams with mind changes ⋮ Universal forecasting algorithms ⋮ Consistent and coherent learning with \(\delta \)-delay ⋮ Comparison of identification criteria for machine inductive inference ⋮ Short proofs for online multiclass prediction on graphs ⋮ A comparison of identification criteria for inductive inference of recursive real-valued functions ⋮ Closedness properties in ex-identification ⋮ Prediction of Recursive Real-Valued Functions from Finite Examples ⋮ Unnamed Item ⋮ Model discrimination using an algorithmic information criterion ⋮ Active Online Learning in the Binary Perceptron Problem ⋮ Prediction-preserving reducibility ⋮ On the power of probabilistic strategies in inductive inference ⋮ 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 ⋮ Language learning from texts: Degrees of intrinsic complexity and their characterizations ⋮ A non-learnable class of E-pattern languages

This page was built for publication: