<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/themes/root/assets/xsl/rss.xsl"?>
<rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/">
  <channel>
    <title>Resultados para Algorithmic randomness*</title>
    <description>Mostrando 1 - 50 Resultados de 85</description>
    <generator>Laminas_Feed_Writer 2 (https://getlaminas.org)</generator>
    <link>https://descubridor.academia.cl/EIT/Search?limit=50&amp;lookfor=Algorithmic+randomness%2A&amp;type=TX&amp;lng=es</link>
    <opensearch:totalResults>85</opensearch:totalResults>
    <opensearch:startIndex>0</opensearch:startIndex>
    <opensearch:itemsPerPage>50</opensearch:itemsPerPage>
    <opensearch:Query role="request" searchTerms="Algorithmic%20randomness%2A" startIndex="0"/>
    <atom:link rel="first" type="application/rss+xml" title="Ir a la Primera Página" href="https://descubridor.academia.cl/EIT/Search?limit=50&amp;view=rss&amp;lookfor=Algorithmic+randomness%2A&amp;type=TX&amp;lng=es"/>
    <atom:link rel="next" type="application/rss+xml" title="Ir a la Siguiente Página" href="https://descubridor.academia.cl/EIT/Search?limit=50&amp;view=rss&amp;lookfor=Algorithmic+randomness%2A&amp;type=TX&amp;lng=es&amp;page=2"/>
    <atom:link rel="last" type="application/rss+xml" title="Ir a la Ultima Página" href="https://descubridor.academia.cl/EIT/Search?limit=50&amp;view=rss&amp;lookfor=Algorithmic+randomness%2A&amp;type=TX&amp;lng=es&amp;page=2"/>
    <atom:link rel="self" type="application/rss+xml" href="https://descubridor.academia.cl/EIT/Search?limit=50&amp;view=rss&amp;lookfor=Algorithmic+randomness%2A&amp;type=TX&amp;lng=es"/>
    <item>
      <title>Bayesian Merging of Opinions and Algorithmic Randomness.</title>
      <pubDate>Wed, 01 Jan 2025 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/189879611</link>
      <guid>https://descubridor.academia.cl/EITRecord/189879611</guid>
      <author>Zaffora Blando, Francesca</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2025-12-01</dc:date>
      <dc:creator>Zaffora Blando, Francesca</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Order, organization, and randomness: on the mathematical formulation of life.</title>
      <pubDate>Mon, 01 Jan 2024 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/180988711</link>
      <guid>https://descubridor.academia.cl/EITRecord/180988711</guid>
      <author>Cosgrove, Joseph K.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2024-12-01</dc:date>
      <dc:creator>Cosgrove, Joseph K.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>LIMIT COMPLEXITIES, MINIMAL DESCRIPTIONS, AND n -RANDOMNESS.</title>
      <pubDate>Wed, 01 Jan 2025 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/190715101</link>
      <guid>https://descubridor.academia.cl/EITRecord/190715101</guid>
      <author>DOWNEY, RODNEY</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2025-09-01</dc:date>
      <dc:creator>DOWNEY, RODNEY</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>From Wald to Schnorr: von Mises' definition of randomness in the aftermath of Ville's Theorem.</title>
      <pubDate>Mon, 01 Jan 2024 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/178885089</link>
      <guid>https://descubridor.academia.cl/EITRecord/178885089</guid>
      <author>Zaffora Blando, Francesca</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2024-08-01</dc:date>
      <dc:creator>Zaffora Blando, Francesca</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS.</title>
      <pubDate>Fri, 01 Jan 2016 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/118003903</link>
      <guid>https://descubridor.academia.cl/EITRecord/118003903</guid>
      <author>PORTER, CHRISTOPHER P.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2016-09-01</dc:date>
      <dc:creator>PORTER, CHRISTOPHER P.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS.</title>
      <pubDate>Fri, 01 Jan 2016 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/118079296</link>
      <guid>https://descubridor.academia.cl/EITRecord/118079296</guid>
      <author>HIRSCHFELDT, DENIS R.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2016-09-01</dc:date>
      <dc:creator>HIRSCHFELDT, DENIS R.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>UNIFORM DISTRIBUTION AND ALGORITHMIC RANDOMNESS.</title>
      <pubDate>Tue, 01 Jan 2013 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/86872429</link>
      <guid>https://descubridor.academia.cl/EITRecord/86872429</guid>
      <author>AVIGAD, JEREMY</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2013-03-01</dc:date>
      <dc:creator>AVIGAD, JEREMY</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE.</title>
      <pubDate>Sat, 01 Jan 2022 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/158569953</link>
      <guid>https://descubridor.academia.cl/EITRecord/158569953</guid>
      <author>STEIFER, TOMASZ</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2022-09-01</dc:date>
      <dc:creator>STEIFER, TOMASZ</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Algorithmic randomness.</title>
      <pubDate>Tue, 01 Jan 2019 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/137694573</link>
      <guid>https://descubridor.academia.cl/EITRecord/137694573</guid>
      <author>Downey, Rod</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2019-05-01</dc:date>
      <dc:creator>Downey, Rod</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS.</title>
      <pubDate>Fri, 01 Jan 2021 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/151440481</link>
      <guid>https://descubridor.academia.cl/EITRecord/151440481</guid>
      <author>BLANDO, FRANCESCA ZAFFORA</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2021-06-01</dc:date>
      <dc:creator>BLANDO, FRANCESCA ZAFFORA</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY.</title>
      <pubDate>Tue, 01 Jan 2019 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/135348251</link>
      <guid>https://descubridor.academia.cl/EITRecord/135348251</guid>
      <author>BIENVENU, LAURENT</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2019-03-01</dc:date>
      <dc:creator>BIENVENU, LAURENT</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Algorithmic randomness in empirical data</title>
      <pubDate>Wed, 01 Jan 2003 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/10694278</link>
      <guid>https://descubridor.academia.cl/EITRecord/10694278</guid>
      <author>McAllister, James W.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2003-09-01</dc:date>
      <dc:creator>McAllister, James W.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>GENERICITY AND RANDOMNESS WITH ITTMS.</title>
      <pubDate>Tue, 01 Jan 2019 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/140922289</link>
      <guid>https://descubridor.academia.cl/EITRecord/140922289</guid>
      <author>MONIN, BENOÎT</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2019-12-01</dc:date>
      <dc:creator>MONIN, BENOÎT</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>REGAININGLY APPROXIMABLE NUMBERS AND SETS.</title>
      <pubDate>Wed, 01 Jan 2025 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/191386361</link>
      <guid>https://descubridor.academia.cl/EITRecord/191386361</guid>
      <author>HERTLING, PETER</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2025-12-01</dc:date>
      <dc:creator>HERTLING, PETER</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>RANK AND RANDOMNESS.</title>
      <pubDate>Tue, 01 Jan 2019 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/140922290</link>
      <guid>https://descubridor.academia.cl/EITRecord/140922290</guid>
      <author>HÖLZL, RUPERT</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2019-12-01</dc:date>
      <dc:creator>HÖLZL, RUPERT</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>INTROENUMERABILITY, AUTOREDUCIBILITY, AND RANDOMNESS.</title>
      <pubDate>Thu, 01 Jan 2026 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/194236703</link>
      <guid>https://descubridor.academia.cl/EITRecord/194236703</guid>
      <author>LI, ANG</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2026-06-01</dc:date>
      <dc:creator>LI, ANG</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>PROBABILISTIC ALGORITHMIC RANDOMNESS.</title>
      <pubDate>Tue, 01 Jan 2013 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/88008582</link>
      <guid>https://descubridor.academia.cl/EITRecord/88008582</guid>
      <author>BUSS, SAM</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2013-06-01</dc:date>
      <dc:creator>BUSS, SAM</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>LEBESGUE DENSITY AND $\prod _1^0$ CLASSES.</title>
      <pubDate>Fri, 01 Jan 2016 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/113600893</link>
      <guid>https://descubridor.academia.cl/EITRecord/113600893</guid>
      <author>KHAN, MUSHFEQ</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2016-03-01</dc:date>
      <dc:creator>KHAN, MUSHFEQ</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>ON THE DECIDABILITY OF THE ${{\rm{\Sigma }}_2}$ THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES.</title>
      <pubDate>Sun, 01 Jan 2017 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/127197707</link>
      <guid>https://descubridor.academia.cl/EITRecord/127197707</guid>
      <author>BARNES, JAMES S.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2017-12-01</dc:date>
      <dc:creator>BARNES, JAMES S.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>NIETZSCHE IN THE AMAZON. FOR A NOMADOLOGY BEYOND ALGORITHMIC GOVERNMENTALITY.</title>
      <pubDate>Fri, 01 Jan 2016 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/120698150</link>
      <guid>https://descubridor.academia.cl/EITRecord/120698150</guid>
      <author>VIGNOLA, PAOLO</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2016</dc:date>
      <dc:creator>VIGNOLA, PAOLO</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>FORCING WITH BUSHY TREES.</title>
      <pubDate>Sun, 01 Jan 2017 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/124107090</link>
      <guid>https://descubridor.academia.cl/EITRecord/124107090</guid>
      <author>KHAN, MUSHFEQ</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2017-06-01</dc:date>
      <dc:creator>KHAN, MUSHFEQ</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>ON REALS WITH ${\rm{\Delta }}_2^0$-BOUNDED COMPLEXITY AND COMPRESSIVE POWER.</title>
      <pubDate>Fri, 01 Jan 2016 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/118079295</link>
      <guid>https://descubridor.academia.cl/EITRecord/118079295</guid>
      <author>HERBERT, IAN</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2016-09-01</dc:date>
      <dc:creator>HERBERT, IAN</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>RANDOMNESS NOTIONS AND REVERSE MATHEMATICS.</title>
      <pubDate>Wed, 01 Jan 2020 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/142723347</link>
      <guid>https://descubridor.academia.cl/EITRecord/142723347</guid>
      <author>NIES, ANDRÉ</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2020-03-01</dc:date>
      <dc:creator>NIES, ANDRÉ</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Speculative futures: Cities, data, and governance beyond smart urbanism.</title>
      <pubDate>Fri, 01 Jan 2016 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/117335126</link>
      <guid>https://descubridor.academia.cl/EITRecord/117335126</guid>
      <author>Leszczynski, Agnieszka</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2016-09-01</dc:date>
      <dc:creator>Leszczynski, Agnieszka</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>On Being 'Random Enough'.</title>
      <pubDate>Tue, 01 Jan 2019 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/138293507</link>
      <guid>https://descubridor.academia.cl/EITRecord/138293507</guid>
      <author>Buzen, Jeff</author>
      <dc:format>Letter to the Editor</dc:format>
      <dc:date>2019-09-01</dc:date>
      <dc:creator>Buzen, Jeff</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS.</title>
      <pubDate>Thu, 01 Jan 2015 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/102228888</link>
      <guid>https://descubridor.academia.cl/EITRecord/102228888</guid>
      <author>AXON, LOGAN M.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2015-06-01</dc:date>
      <dc:creator>AXON, LOGAN M.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS.</title>
      <pubDate>Mon, 01 Jan 2018 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/129383508</link>
      <guid>https://descubridor.academia.cl/EITRecord/129383508</guid>
      <author>WESTRICK, LINDA BROWN</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2018-03-01</dc:date>
      <dc:creator>WESTRICK, LINDA BROWN</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Pride and Probability.</title>
      <pubDate>Mon, 01 Jan 2024 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/179608563</link>
      <guid>https://descubridor.academia.cl/EITRecord/179608563</guid>
      <author>Zaffora Blando, Francesca</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2024-07-01</dc:date>
      <dc:creator>Zaffora Blando, Francesca</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Bayesian Convergence for Computably Bounded Agents.</title>
      <pubDate>Thu, 01 Jan 2026 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/190936535</link>
      <guid>https://descubridor.academia.cl/EITRecord/190936535</guid>
      <author>Huttegger, Simon M.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2026-01-01</dc:date>
      <dc:creator>Huttegger, Simon M.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS.</title>
      <pubDate>Wed, 01 Jan 2014 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/97059208</link>
      <guid>https://descubridor.academia.cl/EITRecord/97059208</guid>
      <author>BIENVENU, LAURENT</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2014-06-01</dc:date>
      <dc:creator>BIENVENU, LAURENT</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Explainability increases trust resilience in intelligent agents.</title>
      <pubDate>Thu, 01 Jan 2026 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/192785882</link>
      <guid>https://descubridor.academia.cl/EITRecord/192785882</guid>
      <author>Xu, Min</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2026-05-01</dc:date>
      <dc:creator>Xu, Min</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>DEEP Π CLASSES.</title>
      <pubDate>Fri, 01 Jan 2016 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/116681681</link>
      <guid>https://descubridor.academia.cl/EITRecord/116681681</guid>
      <author>BIENVENU, LAURENT</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2016-06-01</dc:date>
      <dc:creator>BIENVENU, LAURENT</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>The simplicity of physical laws.</title>
      <pubDate>Wed, 01 Jan 2025 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/189393078</link>
      <guid>https://descubridor.academia.cl/EITRecord/189393078</guid>
      <author>Chen, Eddy Keming</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2025-12-01</dc:date>
      <dc:creator>Chen, Eddy Keming</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY.</title>
      <pubDate>Wed, 01 Jan 2014 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/96277379</link>
      <guid>https://descubridor.academia.cl/EITRecord/96277379</guid>
      <author>HUDELSON, W. M. PHILLIP</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2014-03-01</dc:date>
      <dc:creator>HUDELSON, W. M. PHILLIP</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A REAL OF STRICTLY POSITIVE EFFECTIVE PACKING DIMENSION THAT DOES NOT COMPUTE A REAL OF EFFECTIVE PACKING ONE.</title>
      <pubDate>Sun, 01 Jan 2012 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/76263564</link>
      <guid>https://descubridor.academia.cl/EITRecord/76263564</guid>
      <author>Conidis, Chris J.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2012-06-01</dc:date>
      <dc:creator>Conidis, Chris J.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>AN ALGORITHMIC INFORMATION THEORY CHALLENGE TO INTELLIGENT DESIGN.</title>
      <pubDate>Wed, 01 Jan 2014 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/94610922</link>
      <guid>https://descubridor.academia.cl/EITRecord/94610922</guid>
      <author>Devine, Sean</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2014-03-01</dc:date>
      <dc:creator>Devine, Sean</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Fairness and randomness in decision-making: the case of decision thresholds.</title>
      <pubDate>Wed, 01 Jan 2025 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/186071020</link>
      <guid>https://descubridor.academia.cl/EITRecord/186071020</guid>
      <author>Vredenburgh, Kate</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2025-07-01</dc:date>
      <dc:creator>Vredenburgh, Kate</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Quantum Randomness and Underdetermination.</title>
      <pubDate>Wed, 01 Jan 2020 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/144243024</link>
      <guid>https://descubridor.academia.cl/EITRecord/144243024</guid>
      <author>Barrett, Jeffrey A.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2020-07-01</dc:date>
      <dc:creator>Barrett, Jeffrey A.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A computable von Neumann-Morgenstern representation theorem.</title>
      <pubDate>Wed, 01 Jan 2025 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/184599290</link>
      <guid>https://descubridor.academia.cl/EITRecord/184599290</guid>
      <author>Lopez-Wild, Josiah</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2025-05-01</dc:date>
      <dc:creator>Lopez-Wild, Josiah</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Mechanical Turkeys: Mechanical Turkeys: G. Belot.</title>
      <pubDate>Wed, 01 Jan 2025 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/183283956</link>
      <guid>https://descubridor.academia.cl/EITRecord/183283956</guid>
      <author>Belot, Gordon</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2025-02-01</dc:date>
      <dc:creator>Belot, Gordon</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>THE DEVELOPMENT OF I/O TECHNIQUES IN LITERATURE: FROM NANNI BALESTRINI'S AUTOCODER TO K. SILEM MOHAMMAD'S FLARF AND THE ADVENT OF CHATBOT POETICS.</title>
      <pubDate>Wed, 01 Jan 2025 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/189584475</link>
      <guid>https://descubridor.academia.cl/EITRecord/189584475</guid>
      <author>POLICASTRO, GILDA</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2025</dc:date>
      <dc:creator>POLICASTRO, GILDA</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Repairing Rationality: Max Bense and the Automation of Literature in Post-War Germany.</title>
      <pubDate>Wed, 01 Jan 2025 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/190651395</link>
      <guid>https://descubridor.academia.cl/EITRecord/190651395</guid>
      <author>Holt, Matthew</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2025</dc:date>
      <dc:creator>Holt, Matthew</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Empirical data sets are algorithmically compressible: reply to McAllister?</title>
      <pubDate>Sat, 01 Jan 2005 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/17952930</link>
      <guid>https://descubridor.academia.cl/EITRecord/17952930</guid>
      <author>Twardy, Charles</author>
      <dc:format>Editorial</dc:format>
      <dc:date>2005-06-01</dc:date>
      <dc:creator>Twardy, Charles</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A Neglected God for the Reality of Argument.</title>
      <pubDate>Mon, 01 Jan 2024 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/183057194</link>
      <guid>https://descubridor.academia.cl/EITRecord/183057194</guid>
      <author>Marvin, John</author>
      <dc:format>Editorial</dc:format>
      <dc:date>2024</dc:date>
      <dc:creator>Marvin, John</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>VALUED MODULES OVER SKEW POLYNOMIAL RINGS I.</title>
      <pubDate>Sun, 01 Jan 2017 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/127197712</link>
      <guid>https://descubridor.academia.cl/EITRecord/127197712</guid>
      <author>ONAY, GÖNENÇ</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2017-12-01</dc:date>
      <dc:creator>ONAY, GÖNENÇ</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>RETRACTIONS OF REVERSIBLE STRUCTURES.</title>
      <pubDate>Sun, 01 Jan 2017 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/127197710</link>
      <guid>https://descubridor.academia.cl/EITRecord/127197710</guid>
      <author>KURILIĆ, MILOŠ S.</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2017-12-01</dc:date>
      <dc:creator>KURILIĆ, MILOŠ S.</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>A SYNTACTIC CHARACTERIZATION OF MORITA EQUIVALENCE.</title>
      <pubDate>Sun, 01 Jan 2017 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/127197709</link>
      <guid>https://descubridor.academia.cl/EITRecord/127197709</guid>
      <author>TSEMENTZIS, DIMITRIS</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2017-12-01</dc:date>
      <dc:creator>TSEMENTZIS, DIMITRIS</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>Automated Thinking and the Limits of Reason.</title>
      <pubDate>Fri, 01 Jan 2016 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/118208805</link>
      <guid>https://descubridor.academia.cl/EITRecord/118208805</guid>
      <author>Parisi, Luciana</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2016-10-01</dc:date>
      <dc:creator>Parisi, Luciana</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>That Does Not Compute: David Lewis on Credence and Chance.</title>
      <pubDate>Sun, 01 Jan 2023 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/174317254</link>
      <guid>https://descubridor.academia.cl/EITRecord/174317254</guid>
      <author>Belot, Gordon</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2023-12-01</dc:date>
      <dc:creator>Belot, Gordon</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
    <item>
      <title>DEMUTH’S PATH TO RANDOMNESS.</title>
      <pubDate>Thu, 01 Jan 2015 19:36:47 -0300</pubDate>
      <link>https://descubridor.academia.cl/EITRecord/109455875</link>
      <guid>https://descubridor.academia.cl/EITRecord/109455875</guid>
      <author>KUČERA, ANTONÍN</author>
      <dc:format>Artículo</dc:format>
      <dc:date>2015-09-01</dc:date>
      <dc:creator>KUČERA, ANTONÍN</dc:creator>
      <slash:comments>0</slash:comments>
    </item>
  </channel>
</rss>
