<?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-01817877</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-24T22:27:24+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Towards Analysis of Information Structure of Computations</title>
            <author role="aut">
              <persName>
                <forename type="first">Anatol</forename>
                <surname>Slissenko</surname>
              </persName>
              <email type="md5">7f18b43a080b0348b36d02d888319062</email>
              <email type="domain">u-pec.fr</email>
              <idno type="idhal" notation="numeric">1033220</idno>
              <idno type="halauthorid" notation="string">164689-1033220</idno>
              <affiliation ref="#struct-182989"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Anatol</forename>
                <surname>Slissenko</surname>
              </persName>
              <email type="md5">7f18b43a080b0348b36d02d888319062</email>
              <email type="domain">u-pec.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-06-18 14:39:48</date>
              <date type="whenModified">2024-12-27 19:46:18</date>
              <date type="whenReleased">2018-06-22 15:15:22</date>
              <date type="whenProduced">2017-07</date>
              <date type="whenEndEmbargoed">2018-06-18</date>
              <ref type="file" target="https://hal.science/hal-01817877v1/document">
                <date notBefore="2018-06-18"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01817877v1/file/Slissenko_PhML2012%20%281%29.pdf" id="file-1817877-1846163">
                <date notBefore="2018-06-18"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="323171">
                <persName>
                  <forename>Anatol</forename>
                  <surname>Slissenko</surname>
                </persName>
                <email type="md5">7f18b43a080b0348b36d02d888319062</email>
                <email type="domain">u-pec.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01817877</idno>
            <idno type="halUri">https://hal.science/hal-01817877</idno>
            <idno type="halBibtex">slissenko:hal-01817877</idno>
            <idno type="halRefHtml">&lt;i&gt;The IFCoLog Journal of Logic and its Applications&lt;/i&gt;, 2017, 4 (4), pp.1457--1476</idno>
            <idno type="halRef">The IFCoLog Journal of Logic and its Applications, 2017, 4 (4), pp.1457--1476</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1817877-1846163"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="LACL" corresp="UPEC">Laboratoire d'Algorithmique Complexité et Logique</idno>
            <idno type="stamp" n="UPEC" corresp="CV_UPEC">Université Paris-Est Créteil Val-de-Marne</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Towards Analysis of Information Structure of Computations</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Anatol</forename>
                    <surname>Slissenko</surname>
                  </persName>
                  <email type="md5">7f18b43a080b0348b36d02d888319062</email>
                  <email type="domain">u-pec.fr</email>
                  <idno type="idhal" notation="numeric">1033220</idno>
                  <idno type="halauthorid" notation="string">164689-1033220</idno>
                  <affiliation ref="#struct-182989"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="INCOMING">128223</idno>
                <idno type="issn">9781848902044</idno>
                <title level="j">The IFCoLog Journal of Logic and its Applications</title>
                <imprint>
                  <publisher>UK Charity Ifcolog</publisher>
                  <biblScope unit="volume">4</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <biblScope unit="pp">1457--1476</biblScope>
                  <date type="datePub">2017-07</date>
                </imprint>
              </monogr>
              <ref type="publisher">http://www.collegepublications.co.uk/downloads/ifcolog00013.pdf</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Metric</term>
                <term xml:lang="en">Entropy</term>
                <term xml:lang="en">Partition</term>
                <term xml:lang="en">Problem</term>
                <term xml:lang="en">Computation</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-cl">Computer Science [cs]/Computation and Language [cs.CL]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The paper discusses how one can try to analyze computations, and maybe computational problems from the point of view of information evolution. The considerations presented here are very preliminary. The long-standing goal is twofold: on the one hand, to find other vision of computations that may help to design and analyze algorithms, and on the other hand, to understand what is realistic computation and what is real practical problem. The concepts of modern computer science, that came from classical mathematics of pre-computer era, are overgeneralized, and for this reason are often misleading and counter-productive from the point of view of applications. The present text discusses mainly what classical notions of entropy might give for analysis of computations. In order to better understand the problem, a philosophical discussion of the the essence and relation of knowledge/information/uncertainty in algorith-mic processes might be useful.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-182989" status="VALID">
          <idno type="IdRef">113845588</idno>
          <idno type="RNSR">200715457A</idno>
          <orgName>Laboratoire d'Algorithmique Complexité et Logique</orgName>
          <orgName type="acronym">LACL</orgName>
          <desc>
            <address>
              <addrLine>LACL, Université Paris-Est Créteil Val-de-Marne, 61 avenue du Général de Gaulle 94010 Créteil cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lacl.fr</ref>
          </desc>
          <listRelation>
            <relation name="EA4219" active="#struct-420786" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-420786" status="VALID">
          <idno type="IdRef">028021037</idno>
          <idno type="ISNI">0000000121497878</idno>
          <idno type="ROR">https://ror.org/05ggc9x40</idno>
          <orgName>Université Paris-Est Créteil Val-de-Marne - Paris 12</orgName>
          <orgName type="acronym">UPEC UP12</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>61 avenue du Général de Gaulle - 94010 Créteil cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-pec.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>