<?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-00447965</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-14T18:56:39+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Abstract Geometrical Computation and Computable Analysis</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-1625"/>
            </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">2010-01-19 01:09:30</date>
              <date type="whenModified">2025-08-12 15:30:10</date>
              <date type="whenReleased">2010-01-19 09:29:57</date>
              <date type="whenProduced">2009-08</date>
              <date type="whenEndEmbargoed">2010-01-19</date>
              <ref type="file" target="https://hal.science/hal-00447965v1/document">
                <date notBefore="2010-01-19"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00447965v1/file/Sommaire.pdf" id="file-447965-369830">
                <date notBefore="2010-01-19"/>
              </ref>
            </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-00447965</idno>
            <idno type="halUri">https://hal.science/hal-00447965</idno>
            <idno type="halBibtex">durandlose:hal-00447965</idno>
            <idno type="halRefHtml">&lt;i&gt;International Conference on Unconventional Computation 2009 (UC~'09)&lt;/i&gt;, Aug 2009, Portugal. pp.158-167, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-03745-0_20"&gt;&amp;#x27E8;10.1007/978-3-642-03745-0_20&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">International Conference on Unconventional Computation 2009 (UC~'09), Aug 2009, Portugal. pp.158-167, &amp;#x27E8;10.1007/978-3-642-03745-0_20&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-447965-369830"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-ORLEANS">Université d'Orléans</idno>
            <idno type="stamp" n="ENSI-BOURGES">Ecole Nationale Supérieure d'Ingénieurs de Bourges</idno>
            <idno type="stamp" n="MSL">Modelisation Systemes Langages</idno>
            <idno type="stamp" n="MSL-THESE">Modelisation Systemes Langages</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Abstract Geometrical Computation and Computable Analysis</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-1625"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">International Conference on Unconventional Computation 2009 (UC~'09)</title>
                <meeting>
                  <title>International Conference on Unconventional Computation 2009 (UC~'09)</title>
                  <date type="start">2009-08</date>
                  <country key="PT">Portugal</country>
                </meeting>
                <editor>Costa</editor>
                <editor>José Félix and Dershowitz</editor>
                <editor>Nachum</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">LNCS</biblScope>
                  <biblScope unit="issue">5715</biblScope>
                  <biblScope unit="pp">158-167</biblScope>
                  <date type="datePub">2009</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-03745-0_20</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Type-2 Turing machine</term>
                <term xml:lang="en">Analog computation</term>
                <term xml:lang="en">Abstract geometrical computation</term>
                <term xml:lang="en">Computable analysis</term>
                <term xml:lang="en">Signal machine</term>
                <term xml:lang="en">Type-2 Turing machine.</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Extended Signal machines are proven able to compute any computable function in the understanding of recursive/computable analysis (CA), here type-2 Turing machines (T2-TM) with signed binary encoding. This relies on an intermediate representation of any real number as an integer (in signed binary) plus an exact value in $(-1,1)$ which allows to have only finitely many signals present outside of the computation. Extracting a (signed) bit, improving the precision by one bit and iterating the T2-TM only involve standard signal machines. For exact CA-computations, T2-TM have to deal with an infinite entry and to run through infinitely many iterations to produce an infinite output. This infinite duration can be provided by constructions emulating the black hole model of computation on an \emph{extended} signal machine. Extracting/encoding an infinite sequence of bits is achieved as the limit of the approximation process with a careful handling of accumulations and singulari ties.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1625" status="OLD">
          <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">1987-01-01</date>
          <date type="end">2013-12-31</date>
          <desc>
            <address>
              <addrLine>Batiment IIIA 6 Rue Léonard de Vinci - BP 6759 45067 ORLEANS CEDEX 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-orleans.fr/lifo/</ref>
          </desc>
          <listRelation>
            <relation name="EA4022" active="#struct-300297" type="direct"/>
            <relation name="EA4022" active="#struct-300379" 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-300379" status="VALID">
          <orgName>Ecole Nationale Supérieure d'Ingénieurs de Bourges</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>