Quantum inductive inference by finite automata

DOI10.1016/j.tcs.2008.02.023zbMath1145.68021OpenAlexW2002762899MaRDI QIDQ924168

Rūsiņš Freivalds, Richard F. Bonner

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.023

zbMATH Keywords

learningautomataquantum computationinductive inference

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Quantum computation (81P68)

Related Items (1)

A survey of quantum-like approaches to decision making and cognition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards a mathematical theory of machine discovery from facts
• Probability and plurality for aggregations of learning machines
• Quantum automata and quantum grammars
• On the intrinsic complexity of learning
• Characterizations of 1-Way Quantum Finite Automata
• Dense quantum coding and quantum finite automata
• Probabilistic inductive inference
• Toward a mathematical theory of inductive inference
• Ignoring data may be the only way to learn efficiently
• On the impact of forgetting on learning machines
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Inductive inference of recursive functions: Qualitative theory
• Learning with confidence
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Memory limited inductive inference machines
• Probabilistic automata
• Language identification in the limit
• Implementation and Application of Automata

This page was built for publication: Quantum inductive inference by finite automata