<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01792349</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-04T19:43:21+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage</title>
            <author role="aut">
              <persName>
                <forename type="first">Jérôme</forename>
                <surname>Durand-Lose</surname>
              </persName>
              <email type="md5">05b933bb8d877b64362a879ea11c3eba</email>
              <email type="domain">univ-orleans.fr</email>
              <idno type="idhal" notation="string">jerome-durandlose</idno>
              <idno type="idhal" notation="numeric">15640</idno>
              <idno type="halauthorid" notation="string">14153-15640</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6506-074X</idno>
              <idno type="IDREF">https://www.idref.fr/18037821X</idno>
              <affiliation ref="#struct-241078"/>
              <affiliation ref="#struct-2071"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Jérôme</forename>
                <surname>Durand-Lose</surname>
              </persName>
              <email type="md5">05b933bb8d877b64362a879ea11c3eba</email>
              <email type="domain">univ-orleans.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-05-15 13:37:31</date>
              <date type="whenWritten">2017</date>
              <date type="whenModified">2024-08-01 17:08:02</date>
              <date type="whenReleased">2018-05-15 13:37:31</date>
              <date type="whenProduced">2018</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="110413">
                <persName>
                  <forename>Jérôme</forename>
                  <surname>Durand-Lose</surname>
                </persName>
                <email type="md5">05b933bb8d877b64362a879ea11c3eba</email>
                <email type="domain">univ-orleans.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01792349</idno>
            <idno type="halUri">https://hal.science/hal-01792349</idno>
            <idno type="halBibtex">durandlose:hal-01792349</idno>
            <idno type="halRefHtml">Andrew Adamatzky. &lt;i&gt;Reversibility and Universality, Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday&lt;/i&gt;, 30, Spriger, pp.61-93, 2018, Emergence, Complexity and Computation, 978-3-319-73215-2. &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-73216-9_4"&gt;&amp;#x27E8;10.1007/978-3-319-73216-9_4&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Andrew Adamatzky. Reversibility and Universality, Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday, 30, Spriger, pp.61-93, 2018, Emergence, Complexity and Computation, 978-3-319-73215-2. &amp;#x27E8;10.1007/978-3-319-73216-9_4&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="X">École polytechnique</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-ORLEANS">Université d'Orléans</idno>
            <idno type="stamp" n="LIX" corresp="X">Laboratoire d'informatique de l'Ecole polytechnique</idno>
            <idno type="stamp" n="X-DEP-INFO">Département d'informatique de l’École polytechnique</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="X-SACLAY" corresp="UNIV-PARIS-SACLAY">X-SACLAY</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="INSA-CVL">INSA CENTRE VAL DE LOIRE</idno>
            <idno type="stamp" n="TEST3-HALCNRS">TEST3-HALCNRS</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jérôme</forename>
                    <surname>Durand-Lose</surname>
                  </persName>
                  <email type="md5">05b933bb8d877b64362a879ea11c3eba</email>
                  <email type="domain">univ-orleans.fr</email>
                  <idno type="idhal" notation="string">jerome-durandlose</idno>
                  <idno type="idhal" notation="numeric">15640</idno>
                  <idno type="halauthorid" notation="string">14153-15640</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6506-074X</idno>
                  <idno type="IDREF">https://www.idref.fr/18037821X</idno>
                  <affiliation ref="#struct-241078"/>
                  <affiliation ref="#struct-2071"/>
                </author>
              </analytic>
              <monogr>
                <idno type="isbn">978-3-319-73215-2</idno>
                <title level="m">Reversibility and Universality, Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday</title>
                <editor>Andrew Adamatzky</editor>
                <imprint>
                  <publisher>Spriger</publisher>
                  <biblScope unit="serie">Emergence, Complexity and Computation</biblScope>
                  <biblScope unit="issue">30</biblScope>
                  <biblScope unit="pp">61-93</biblScope>
                  <date type="datePub">2018</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-73216-9_4</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en"> Reversible Cellular Automata</term>
                <term xml:lang="en"> Reversibility </term>
                <term xml:lang="en"> Partitioned Cellular Automata </term>
                <term xml:lang="en"> Margolus neighborhood </term>
                <term xml:lang="en"> Invertibility </term>
                <term xml:lang="en"> Intrinsic Universality </term>
                <term xml:lang="en"> Cellular Automata </term>
                <term xml:lang="en">Block Cellular Automata </term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-fl">Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]</classCode>
              <classCode scheme="halDomain" n="math.math-ds">Mathematics [math]/Dynamical Systems [math.DS]</classCode>
              <classCode scheme="halTypology" n="COUV">Book sections</classCode>
              <classCode scheme="halOldTypology" n="COUV">Book sections</classCode>
              <classCode scheme="halTreeTypology" n="COUV">Book sections</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>This chapter presents the use of Partitioned Cellular Automata —introduced by Morita and colleagues— as the tool to tackle simulation and intrinsic universality in the context of Reversible Cellular Automata.  Cellular automata (CA) are mappings over infinite lattices such that all cells are updated synchronously according to the states around each one and a common local function. A CA is reversible if its global function is invertible and its inverse can also be expressed as a CA. Kari proved in 1989 that invertibility is not decidable (for CA of dimension at least 2) and is thus hard to manipulate. Partitioned Cellular Automata (PCA) were introduced as an easy way to handle reversibility by partitioning the states of cells according to the neighborhood. Another approach by Margolus led to the definition of Block CA (BCA) where blocks of cells are updated independently. Both models allow easy check and design for reversibility.  After proving that CA, BCA and PCA can simulate each other, it is proven that the reversible sub-classes can also simulate each other contradicting the intuition based on decidability results. In particular, it is proven that any d-dimensional reversible CA (d-R-CA) can be expressed as a BCA with d+1 partitions. This proves a 1990 conjecture by Toffoli and Margolus (Physica D 45) improved and partially proved by Kari in 1996 (Mathematical System Theory 29). With the use of signals and reversible programming, a 1-R-CA that is intrinsically universal —able to simulate any 1-R-CA— is built. Finally, with a peculiar definition of simulation, it is proven that any CA (reversible or not) can be simulated by a reversible one. All these results extend to any dimension.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-241078" status="VALID">
          <idno type="IdRef">075434695</idno>
          <idno type="RNSR">200615274F</idno>
          <orgName>Laboratoire d'Informatique Fondamentale d'Orléans</orgName>
          <orgName type="acronym">LIFO</orgName>
          <date type="start">2014-01-01</date>
          <desc>
            <address>
              <addrLine>Bâtiment IIIA, Rue Léonard de Vinci, B.P. 6759, F-45067 ORLEANS Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-orleans.fr/lifo/</ref>
          </desc>
          <listRelation>
            <relation name="EA 4022" active="#struct-300297" type="direct"/>
            <relation name="EA 4022" active="#struct-303079" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2071" status="VALID">
          <idno type="IdRef">196509955</idno>
          <idno type="ISNI">0000000403673665</idno>
          <idno type="RNSR">200519331V</idno>
          <idno type="ROR">https://ror.org/04afed728</idno>
          <idno type="Wikidata">Q16009025</idno>
          <orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
          <orgName type="acronym">LIX</orgName>
          <date type="start">2005-01-01</date>
          <desc>
            <address>
              <addrLine>1 Rue Honoré d’Estienne d’Orves, Bâtiment Alain Turing, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lix.polytechnique.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300340" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
            <relation name="UMR7161" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300297" status="VALID">
          <idno type="IdRef">026402971</idno>
          <idno type="ISNI">0000 0001 2158 1666</idno>
          <idno type="ROR">https://ror.org/014zrew76</idno>
          <orgName>Université d'Orléans</orgName>
          <orgName type="acronym">UO</orgName>
          <desc>
            <address>
              <addrLine>Château de la Source - Avenue du Parc Floral - BP 6749 - 45067 Orléans cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-orleans.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303079" status="VALID">
          <idno type="IdRef">203592077</idno>
          <orgName>Institut National des Sciences Appliquées - Centre Val de Loire</orgName>
          <orgName type="acronym">INSA CVL</orgName>
          <date type="start">2014-01-01</date>
          <desc>
            <address>
              <addrLine>88 boulevard Lahitolle, CS 60013, 18022 Bourges cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-centrevaldeloire.fr/fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300340" status="VALID">
          <idno type="IdRef">027309320</idno>
          <idno type="ISNI">0000000121581279</idno>
          <idno type="ROR">https://ror.org/05hy3tk52</idno>
          <idno type="Wikidata">Q273626</idno>
          <orgName>École polytechnique</orgName>
          <orgName type="acronym">X</orgName>
          <date type="start">1794-03-11</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91128 Palaiseau Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.polytechnique.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>