The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class

We examine several notions of randomness for elements in a given Π10 class P. Such an effectively closed subset P of 2ωmay be viewed as the set of infinite paths through the tree TP of extendible nodes of P, i.e., those finite strings that extend to a member of P, so one approach to defining a rando...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory of computing systems 2018-10, Vol.62 (7), p.1637-1671
Hauptverfasser: Cenzer, Douglas, Porter, Christopher P.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1671
container_issue 7
container_start_page 1637
container_title Theory of computing systems
container_volume 62
creator Cenzer, Douglas
Porter, Christopher P.
description We examine several notions of randomness for elements in a given Π10 class P. Such an effectively closed subset P of 2ωmay be viewed as the set of infinite paths through the tree TP of extendible nodes of P, i.e., those finite strings that extend to a member of P, so one approach to defining a random member of P is to randomly produce a path through TP using a sufficiently random oracle for advice. In addition, this notion of randomness for elements of P may be induced by a map from 2ωonto P that is computable relative to TP, and the notion even has a characterization in term of Kolmogorov complexity. Another approach is to define a relative measure on P by conditionalizing the Lebesgue measure on P, which becomes interesting if P has Lebesgue measure 0. Lastly, one can alternatively define a notion of incompressibility for members of P in terms of the amount of branching at levels of TP. We explore some notions of homogeneity for Π10 classes, inspired by work of van Lambalgen. A key finding is that in a specific class of sufficiently homogeneous Π10 classes P, all of these approaches coincide. We conclude with a discussion of random members of Π10 classes of positive measure.
doi_str_mv 10.1007/s00224-017-9824-3
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1968180131</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1968180131</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1181-6126c31828bfe1f7a16c3679d8ef7e94f70a572ae67e2a5ccc156574824551853</originalsourceid><addsrcrecordid>eNotkM1KAzEUhYMoWKsP4C5gt9F78z9LGbQKFUXqTgzpNMGWTqcmdiHDvItP5DM5ta7uuXA4h_MRco5wiQDmKgNwLhmgYYXthTggA5RCMJAFHP5pzqRQcExOcl4CgLAAA6Km74E--_W8qelDqGchZdpE6unPN0UKdNS-Pi1o51rs3lroRrRc-ZxPyVH0qxzO_u-QvNzeTMs7Nnkc35fXE1YhWmQaua4EWm5nMWA0HvtXm2JuQzShkNGAV4b7oE3gXlVVhUorI_sBSqFVYkgu9rmb1HxsQ_50y2ab1n2lw0JbtIACexfuXVVqck4huk1a1D59OQS3o-P2dFxPx-3oOCF-AT58U2s</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1968180131</pqid></control><display><type>article</type><title>The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class</title><source>SpringerNature Journals</source><source>EBSCOhost Business Source Complete</source><creator>Cenzer, Douglas ; Porter, Christopher P.</creator><creatorcontrib>Cenzer, Douglas ; Porter, Christopher P.</creatorcontrib><description>We examine several notions of randomness for elements in a given Π10 class P. Such an effectively closed subset P of 2ωmay be viewed as the set of infinite paths through the tree TP of extendible nodes of P, i.e., those finite strings that extend to a member of P, so one approach to defining a random member of P is to randomly produce a path through TP using a sufficiently random oracle for advice. In addition, this notion of randomness for elements of P may be induced by a map from 2ωonto P that is computable relative to TP, and the notion even has a characterization in term of Kolmogorov complexity. Another approach is to define a relative measure on P by conditionalizing the Lebesgue measure on P, which becomes interesting if P has Lebesgue measure 0. Lastly, one can alternatively define a notion of incompressibility for members of P in terms of the amount of branching at levels of TP. We explore some notions of homogeneity for Π10 classes, inspired by work of van Lambalgen. A key finding is that in a specific class of sufficiently homogeneous Π10 classes P, all of these approaches coincide. We conclude with a discussion of random members of Π10 classes of positive measure.</description><identifier>ISSN: 1432-4350</identifier><identifier>EISSN: 1433-0490</identifier><identifier>DOI: 10.1007/s00224-017-9824-3</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Algorithms ; Incompressibility ; Probability ; Randomness ; Strings</subject><ispartof>Theory of computing systems, 2018-10, Vol.62 (7), p.1637-1671</ispartof><rights>Theory of Computing Systems is a copyright of Springer, (2017). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1181-6126c31828bfe1f7a16c3679d8ef7e94f70a572ae67e2a5ccc156574824551853</citedby><cites>FETCH-LOGICAL-c1181-6126c31828bfe1f7a16c3679d8ef7e94f70a572ae67e2a5ccc156574824551853</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,781,785,27928,27929</link.rule.ids></links><search><creatorcontrib>Cenzer, Douglas</creatorcontrib><creatorcontrib>Porter, Christopher P.</creatorcontrib><title>The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class</title><title>Theory of computing systems</title><description>We examine several notions of randomness for elements in a given Π10 class P. Such an effectively closed subset P of 2ωmay be viewed as the set of infinite paths through the tree TP of extendible nodes of P, i.e., those finite strings that extend to a member of P, so one approach to defining a random member of P is to randomly produce a path through TP using a sufficiently random oracle for advice. In addition, this notion of randomness for elements of P may be induced by a map from 2ωonto P that is computable relative to TP, and the notion even has a characterization in term of Kolmogorov complexity. Another approach is to define a relative measure on P by conditionalizing the Lebesgue measure on P, which becomes interesting if P has Lebesgue measure 0. Lastly, one can alternatively define a notion of incompressibility for members of P in terms of the amount of branching at levels of TP. We explore some notions of homogeneity for Π10 classes, inspired by work of van Lambalgen. A key finding is that in a specific class of sufficiently homogeneous Π10 classes P, all of these approaches coincide. We conclude with a discussion of random members of Π10 classes of positive measure.</description><subject>Algorithms</subject><subject>Incompressibility</subject><subject>Probability</subject><subject>Randomness</subject><subject>Strings</subject><issn>1432-4350</issn><issn>1433-0490</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNotkM1KAzEUhYMoWKsP4C5gt9F78z9LGbQKFUXqTgzpNMGWTqcmdiHDvItP5DM5ta7uuXA4h_MRco5wiQDmKgNwLhmgYYXthTggA5RCMJAFHP5pzqRQcExOcl4CgLAAA6Km74E--_W8qelDqGchZdpE6unPN0UKdNS-Pi1o51rs3lroRrRc-ZxPyVH0qxzO_u-QvNzeTMs7Nnkc35fXE1YhWmQaua4EWm5nMWA0HvtXm2JuQzShkNGAV4b7oE3gXlVVhUorI_sBSqFVYkgu9rmb1HxsQ_50y2ab1n2lw0JbtIACexfuXVVqck4huk1a1D59OQS3o-P2dFxPx-3oOCF-AT58U2s</recordid><startdate>201810</startdate><enddate>201810</enddate><creator>Cenzer, Douglas</creator><creator>Porter, Christopher P.</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>201810</creationdate><title>The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class</title><author>Cenzer, Douglas ; Porter, Christopher P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1181-6126c31828bfe1f7a16c3679d8ef7e94f70a572ae67e2a5ccc156574824551853</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Incompressibility</topic><topic>Probability</topic><topic>Randomness</topic><topic>Strings</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cenzer, Douglas</creatorcontrib><creatorcontrib>Porter, Christopher P.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Theory of computing systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cenzer, Douglas</au><au>Porter, Christopher P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class</atitle><jtitle>Theory of computing systems</jtitle><date>2018-10</date><risdate>2018</risdate><volume>62</volume><issue>7</issue><spage>1637</spage><epage>1671</epage><pages>1637-1671</pages><issn>1432-4350</issn><eissn>1433-0490</eissn><abstract>We examine several notions of randomness for elements in a given Π10 class P. Such an effectively closed subset P of 2ωmay be viewed as the set of infinite paths through the tree TP of extendible nodes of P, i.e., those finite strings that extend to a member of P, so one approach to defining a random member of P is to randomly produce a path through TP using a sufficiently random oracle for advice. In addition, this notion of randomness for elements of P may be induced by a map from 2ωonto P that is computable relative to TP, and the notion even has a characterization in term of Kolmogorov complexity. Another approach is to define a relative measure on P by conditionalizing the Lebesgue measure on P, which becomes interesting if P has Lebesgue measure 0. Lastly, one can alternatively define a notion of incompressibility for members of P in terms of the amount of branching at levels of TP. We explore some notions of homogeneity for Π10 classes, inspired by work of van Lambalgen. A key finding is that in a specific class of sufficiently homogeneous Π10 classes P, all of these approaches coincide. We conclude with a discussion of random members of Π10 classes of positive measure.</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1007/s00224-017-9824-3</doi><tpages>35</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1432-4350
ispartof Theory of computing systems, 2018-10, Vol.62 (7), p.1637-1671
issn 1432-4350
1433-0490
language eng
recordid cdi_proquest_journals_1968180131
source SpringerNature Journals; EBSCOhost Business Source Complete
subjects Algorithms
Incompressibility
Probability
Randomness
Strings
title The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T19%3A58%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Random%20Members%20of%20a%20%CE%A0%201%200%20$%7B%5CPi%20%7D_%7B1%7D%5E%7B0%7D$%20Class&rft.jtitle=Theory%20of%20computing%20systems&rft.au=Cenzer,%20Douglas&rft.date=2018-10&rft.volume=62&rft.issue=7&rft.spage=1637&rft.epage=1671&rft.pages=1637-1671&rft.issn=1432-4350&rft.eissn=1433-0490&rft_id=info:doi/10.1007/s00224-017-9824-3&rft_dat=%3Cproquest_cross%3E1968180131%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1968180131&rft_id=info:pmid/&rfr_iscdi=true