Minimal weak truth table degrees and computably enumerable Turing degrees (Q5113922)
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: Minimal weak truth table degrees and computably enumerable Turing degrees |
scientific article; zbMATH DE number 7213240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal weak truth table degrees and computably enumerable Turing degrees |
scientific article; zbMATH DE number 7213240 |
Statements
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees (English)
0 references
19 June 2020
0 references
computably enumerable set
0 references
Turing degree
0 references
weak truth-table degree
0 references
minimal degree
0 references
promptly simple set
0 references
full approximation method
0 references
0.8127476572990417
0 references
0.8032743334770203
0 references
0.7958039045333862
0 references
0.7944209575653076
0 references
0.7944209575653076
0 references
