Inductive inference of recursive functions: Complexity bounds (Q4560353): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Rūsiņš Freivalds / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Ja. M. Barzdin' / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5685065 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the inference of Turing machines from sample computations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5679689 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Language identification in the limit / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3214803 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5633933 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4108307 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4155834 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4155804 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bfb0019358 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1590972739 / rank | |||
Normal rank |
Latest revision as of 09:36, 30 July 2024
scientific article; zbMATH DE number 6992064
Language | Label | Description | Also known as |
---|---|---|---|
English | Inductive inference of recursive functions: Complexity bounds |
scientific article; zbMATH DE number 6992064 |
Statements
Inductive inference of recursive functions: Complexity bounds (English)
0 references
11 December 2018
0 references
Turing machine
0 references
recursive function
0 references
inductive inference
0 references
finite automaton
0 references
prediction strategy
0 references