Quantum inductive inference by finite automata (Q924168): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4938665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense quantum coding and quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a mathematical theory of machine discovery from facts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with confidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a mathematical theory of inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of 1-Way Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of recursive functions: Qualitative theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory limited inductive inference machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impact of forgetting on learning machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intrinsic complexity of learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and plurality for aggregations of learning machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ignoring data may be the only way to learn efficiently / rank
 
Normal rank

Latest revision as of 10:58, 28 June 2024

scientific article
Language Label Description Also known as
English
Quantum inductive inference by finite automata
scientific article

    Statements

    Quantum inductive inference by finite automata (English)
    0 references
    28 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum computation
    0 references
    automata
    0 references
    inductive inference
    0 references
    learning
    0 references
    0 references
    0 references
    0 references