Quantum inductive inference by finite automata

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Freivalds and Smith [R. Freivalds, C.H. Smith Memory limited inductive inference machines, Springer Lecture Notes in Computer Science 621 (1992) 19-29] proved that probabilistic limited memory inductive inference machines can learn with probability 1 certain classes of total recursive functions, which cannot be learned by deterministic limited memory inductive inference machines. We introduce quantum limited memory inductive inference machines as quantum finite automata acting as inductive inference machines. These machines, we show, can learn classes of total recursive functions not learnable by any deterministic, nor even by probabilistic, limited memory inductive inference machines. © 2008 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Freivalds, R., & Bonner, R. F. (2008). Quantum inductive inference by finite automata. Theoretical Computer Science, 397(1–3), 70–76. https://doi.org/10.1016/j.tcs.2008.02.023

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free