Three-Processor Tasks Are Undecidable (Q4229418): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:09, 6 February 2024
scientific article; zbMATH DE number 1252580
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three-Processor Tasks Are Undecidable |
scientific article; zbMATH DE number 1252580 |
Statements
Three-Processor Tasks Are Undecidable (English)
0 references
22 February 1999
0 references
asynchronous distributed computation
0 references
task-solvability
0 references
wait-free computation
0 references
contractibility problem
0 references
