Exhaustible sets in higher-type computation (Q3535608)
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 5365475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exhaustible sets in higher-type computation |
scientific article; zbMATH DE number 5365475 |
Statements
Exhaustible sets in higher-type computation (English)
0 references
13 November 2008
0 references
algorithmic universal quantification
0 references
continuous predicate
0 references
searchable sets
0 references
decidable sets
0 references
exhaustible sets
0 references
Cantor space
0 references
hierarchy of continuous functionals
0 references
0.7882506847381592
0 references
0.7320849895477295
0 references
0.7191527485847473
0 references
0.708500325679779
0 references
