Fixed point constructions in tilings and cellular automata

Tietueen suppeat tiedot
dc.contributor.authorTörmä Ilkka
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id67640603
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/67640603
dc.date.accessioned2025-08-27T21:47:06Z
dc.date.available2025-08-27T21:47:06Z
dc.description.abstract<p>The fixed point construction is a method for designing tile sets and cellular automata with highly nontrivial dynamical and computational properties. It produces an infinite hierarchy of systems where each layer simulates the next one. The simulations are implemented entirely by computations of Turing machines embedded in the tilings or spacetime diagrams. We present an overview of the construction and list its applications in the literature.<br></p>
dc.format.pagerange4:1
dc.format.pagerange4:13
dc.identifier.isbn978-3-95977-189-4
dc.identifier.jour-issn2190-6807
dc.identifier.olddbid201115
dc.identifier.oldhandle10024/184142
dc.identifier.urihttps://www.utupub.fi/handle/11111/47597
dc.identifier.urlhttps://drops.dagstuhl.de/opus/volltexte/2021/14013/
dc.identifier.urnURN:NBN:fi-fe2021110854365
dc.language.isoen
dc.okm.affiliatedauthorTörmä, Ilkka
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA4 Conference Article
dc.publisher.countryGermanyen_GB
dc.publisher.countrySaksafi_FI
dc.publisher.country-codeDE
dc.relation.conferenceInternational Workshop on Cellular Automata and Discrete Complex Systems
dc.relation.doi10.4230/OASIcs.AUTOMATA.2021.4
dc.relation.ispartofjournalOpen Access Series in Informatics
dc.relation.ispartofseriesOpen access series in informatics
dc.relation.volume90
dc.source.identifierhttps://www.utupub.fi/handle/10024/184142
dc.titleFixed point constructions in tilings and cellular automata
dc.title.book27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2021)
dc.year.issued2021

Tiedostot

Näytetään 1 - 1 / 1
Name:
OASIcs-AUTOMATA-2021-4.pdf
Size:
626.13 KB
Format:
Adobe Portable Document Format
Description:
Publisher's PDF
Lataa

Kokoelmat

Rinnakkaistallenteet