RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
Video Library
Archive
Most viewed videos

Search
RSS
New in collection





You may need the following programs to see the files






Symposium on logic and computability "Logic and Computation Day"
June 7, 2013 15:30–16:15, Moscow, Steklov Mathematical Institute of RAS
 


Fixed-point tile sets and their applications

A. Romashchenko

A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow

Number of views:
This page:35

Abstract: An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (Entscheidungsproblem) to physics (quasicrystals). We present a construction of an aperiodic tile set that is based on Kleene's fixed-point construction instead of traditional geometric arguments. This construction it very flexible, and it can be used in embed many supplementary features in a tiling: it is suitable to give a new proof for the undecidability of the domino problem, to enforce high Kolmogorov complexity of a tiling, to characterize effectively closed 1D subshift it terms of 2D shifts of finite type, to construct a robust aperiodic tile set that does not have periodic (or close to periodic) tilings even if we allow sparse tiling errors, etc. Joint work with Bruno Durand and Alexander Shen.

Language: English

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018