Computability-theoretic learning complexity (Q2941604)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6474861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computability-theoretic learning complexity |
scientific article; zbMATH DE number 6474861 |
Statements
Computability-theoretic learning complexity (English)
0 references
21 August 2015
0 references
computability-theoretic learning
0 references
self-reference
0 references
epitomizing success criteria
0 references
reducibilities and completeness
0 references
minds and machines
0 references
inductive inference
0 references
0 references
0.9280036687850952
0 references
0.7951023578643799
0 references
0.7605735659599304
0 references
0.756475567817688
0 references
0.7440793514251709
0 references
