A simple constructive computability theorem for wait-free computation (Q2817615)
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 6621794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple constructive computability theorem for wait-free computation |
scientific article; zbMATH DE number 6621794 |
Statements
A simple constructive computability theorem for wait-free computation (English)
0 references
1 September 2016
0 references
0.9084418
0 references
0.8910637
0 references
0.88457876
0 references
0.8665301
0 references
0.86205935
0 references
0.84717894
0 references
0.84009224
0 references
