Comparison of identification criteria for machine inductive inference (Q585192): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5670562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685065 / 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: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity in generations of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4300060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anomaly hierarchies of mechanized inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3930633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decidability results on grammatical inference and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in the theory of inductive inference by GDR mathematicians - A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of computable functions defined by bounds on computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some natural properties of strong-identification in inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4096931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gödel numberings of partial recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Pluralism for Automatic Program Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism, mentalism, and metamathematics. An essay on finitism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170707 / rank
 
Normal rank

Latest revision as of 10:46, 14 June 2024

scientific article
Language Label Description Also known as
English
Comparison of identification criteria for machine inductive inference
scientific article

    Statements

    Comparison of identification criteria for machine inductive inference (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    identification
    0 references
    inductive inference
    0 references
    anomalies in programs
    0 references
    tradeoff results
    0 references
    inherent relative computational complexity
    0 references
    philosophy of science
    0 references
    recursive function theory
    0 references
    0 references