Inductive inference of recursive functions: Complexity bounds (Q4560353): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Rūsiņš Freivalds / rank | |||
| Property / author | |||
| Property / author: Ja. M. Barzdin' / rank | |||
| 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 | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:22, 5 March 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
