Berger's theorem on cellular automata
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:author |
gptkb:Robert_Berger
|
| gptkbp:field |
gptkb:mathematics
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Berger's theorem on cellular automata
|
| gptkbp:impact |
Showed the existence of aperiodic tile sets
|
| gptkbp:influenced |
study of computational universality in cellular automata
|
| gptkbp:publishedIn |
gptkb:Memoirs_of_the_American_Mathematical_Society
|
| gptkbp:relatedConcept |
gptkb:Wang_tiles
undecidability cellular automaton tiling problem |
| gptkbp:sentence |
There is no algorithm to decide whether a given set of Wang tiles can tile the plane
The domino problem is undecidable |
| gptkbp:yearProved |
1966
|
| gptkbp:bfsParent |
gptkb:Aaron_Berger
|
| gptkbp:bfsLayer |
6
|