Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting (Q2805159): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:38, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting |
scientific article |
Statements
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting (English)
0 references
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
