Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Q3313255)
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: Recurring Dominoes: Making the Highly Undecidable Highly Understandable |
scientific article; zbMATH DE number 3843131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recurring Dominoes: Making the Highly Undecidable Highly Understandable |
scientific article; zbMATH DE number 3843131 |
Statements
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (English)
0 references
1985
0 references
program logic
0 references
tiling problem
0 references
undecidability
0 references
recurring domino problems
0 references
0 references
0.82973146
0 references
0.82924443
0 references
0.8284381
0 references
0 references
