Computer Science – Logic in Computer Science
Scientific paper
2010-03-14
Published in Bulletin of the EATCS (The Logic in Computer Science Column by Yuri Gurevich) no. 97 (2009) pp. 126-136: http:/
Computer Science
Logic in Computer Science
8 pages, 5 figures
Scientific paper
We propose a new simple construction of an aperiodic tile set based on self-referential (fixed point) argument. People often say about some discovery that it appeared "ahead of time", meaning that it could be fully understood only in the context of ideas developed later. For the topic of this note, the construction of an aperiodic tile set based on the fixed-point (self-referential) approach, the situation is exactly the opposite. It should have been found in 1960s when the question about aperiodic tile sets was first asked: all the tools were quite standard and widely used at that time. However, the history had chosen a different path and many nice geometric ad hoc constructions were developed instead (by Berger, Robinson, Penrose, Ammann and many others. In this note we try to correct this error and present a construction that should have been discovered first but seemed to be unnoticed for more that forty years.
Durand Bruno
Romashchenko Andrei
Shen Alexander
No associations
LandOfFree
Fixed point theorem and aperiodic tilings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fixed point theorem and aperiodic tilings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed point theorem and aperiodic tilings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-443945