Semi-decidability of may, must and probabilistic testing in a higher-type setting (Q2805159)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Semi-decidability of may, must and probabilistic testing in a higher-type setting |
scientific article; zbMATH DE number 6578703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-decidability of may, must and probabilistic testing in a higher-type setting |
scientific article; zbMATH DE number 6578703 |
Statements
10 May 2016
0 references
nondeterministic computation
0 references
probabilistic computation
0 references
higher-type computability theory
0 references
exhaustible sets
0 references
may and must testing
0 references
operational semantics
0 references
denotational semantics
0 references
powerdomains
0 references
Semi-decidability of may, must and probabilistic testing in a higher-type setting (English)
0 references
0.7436745762825012
0 references
0.7236249446868896
0 references
0.7191339135169983
0 references
