{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/87001"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/87001","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Kolmogorov Complexity, Strong Reducibilities, and Computably Enumerable Sets","abstract":"We also study connections between strong reducibilities and properties of computably enumerable sets such as simplicity. We call a class S of computably enumerable sets bounded if there is an m-incomplete computably enumerable set A such that every set in S is m-reducible to A. For example, we show that the class of effectively simple sets is bounded; but the class of maximal sets is not. Furthermore, the class of computably enumerable sets Turing reducible to a computably enumerable set B is bounded if and only if B is low2. For r = bwtt, tt, wtt, and T, there is a bounded class intersecting every computably enumerable r-degree; for r = c, d and p, no such class exists.","abstract_html":"We also study connections between strong reducibilities and properties of computably enumerable sets such as simplicity. We call a class S of computably enumerable sets bounded if there is an m-incomplete computably enumerable set A such that every set in S is m-reducible to A. For example, we show that the class of effectively simple sets is bounded; but the class of maximal sets is not. Furthermore, the class of computably enumerable sets Turing reducible to a computably enumerable set B is bounded if and only if B is low2. For r = bwtt, tt, wtt, and T, there is a bounded class intersecting every computably enumerable r-degree; for r = c, d and p, no such class exists.","abstract_has_math":false,"creators":["Ho, Kejia"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Jockusch, Carl G., Jr."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-28T15:20:33Z","date_published":"2015-09-28T15:20:33Z","updated_at":"2026-07-22T22:26:28Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI9990023"],"render_values":[{"text":"(MiAaPQ)AAI9990023","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/87001","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Jockusch, Carl G., Jr."]},{"key":"dc:creator","label":"Author","values":["Ho, Kejia"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-28T15:20:33Z","10000-01-01","2000"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/87001","(MiAaPQ)AAI9990023"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We also study connections between strong reducibilities and properties of computably enumerable sets such as simplicity. We call a class S of computably enumerable sets bounded if there is an m-incomplete computably enumerable set A such that every set in S is m-reducible to A. For example, we show that the class of effectively simple sets is bounded; but the class of maximal sets is not. Furthermore, the class of computably enumerable sets Turing reducible to a computably enumerable set B is bounded if and only if B is low2. For r = bwtt, tt, wtt, and T, there is a bounded class intersecting every computably enumerable r-degree; for r = c, d and p, no such class exists.","Made available in DSpace on 2015-09-28T15:20:33Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9990023.pdf: 5098793 bytes, checksum: d5f3891595cda89102ce493ab6fb4547 (MD5) Previous issue date: 2000","Embargo set by: Seth Robbins for item 88282 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","114 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000."]},{"key":"dc:title","label":"Title","values":["Kolmogorov Complexity, Strong Reducibilities, and Computably Enumerable Sets"]}]}],"canonical_facts":{"dc:contributor":["Jockusch, Carl G., Jr."],"dc:creator":["Ho, Kejia"],"dc:date":["2015-09-28T15:20:33Z","10000-01-01","2000"],"dc:description":["We also study connections between strong reducibilities and properties of computably enumerable sets such as simplicity. We call a class S of computably enumerable sets bounded if there is an m-incomplete computably enumerable set A such that every set in S is m-reducible to A. For example, we show that the class of effectively simple sets is bounded; but the class of maximal sets is not. Furthermore, the class of computably enumerable sets Turing reducible to a computably enumerable set B is bounded if and only if B is low2. For r = bwtt, tt, wtt, and T, there is a bounded class intersecting every computably enumerable r-degree; for r = c, d and p, no such class exists.","Made available in DSpace on 2015-09-28T15:20:33Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 9990023.pdf: 5098793 bytes, checksum: d5f3891595cda89102ce493ab6fb4547 (MD5) Previous issue date: 2000","Embargo set by: Seth Robbins for item 88282 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","114 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000."],"dc:identifier":["http://hdl.handle.net/2142/87001","(MiAaPQ)AAI9990023"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Kolmogorov Complexity, Strong Reducibilities, and Computably Enumerable Sets"],"dc:type":["text"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:28Z"}