Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
gptkb:Wang_tile_problem
|
| gptkbp:describes |
Given a finite set of domino types, is it possible to tile the infinite plane so that adjacent edges match?
|
| gptkbp:field |
gptkb:logic
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
domino problem
|
| gptkbp:introduced |
gptkb:Hao_Wang
|
| gptkbp:introducedIn |
1961
|
| gptkbp:notableAchievement |
undecidable
|
| gptkbp:relatedTo |
Technical Machine
undecidability tiling problem |
| gptkbp:bfsParent |
gptkb:Wang's_conjecture
gptkb:Wang_tiles |
| gptkbp:bfsLayer |
6
|