Computing K-Trivial Sets By Incomplete Random Sets

Bienvenu, L; Day, AR; Greenberg, N; Kučera, A; Miller, JS; Nies, Andre; Turetsky, D

dc.contributor.author	Bienvenu, L	en
dc.contributor.author	Day, AR	en
dc.contributor.author	Greenberg, N	en
dc.contributor.author	Kučera, A	en
dc.contributor.author	Miller, JS	en
dc.contributor.author	Nies, Andre	en
dc.contributor.author	Turetsky, D	en
dc.date.accessioned	2015-01-23T03:28:11Z	en
dc.date.issued	2014-03	en
dc.identifier.citation	The Bulletin of Symbolic Logic, 2014, 20 (01), pp. 80 - 90	en
dc.identifier.issn	1079-8986	en
dc.identifier.uri	http://hdl.handle.net/2292/24252	en
dc.description.abstract	Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Martin-Löf random set that does not compute the halting problem.	en
dc.publisher	Association for Symbolic Logic	en
dc.relation.ispartofseries	The Bulletin of Symbolic Logic	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://www.sherpa.ac.uk/romeo/issn/1079-8986/	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.title	Computing K-Trivial Sets By Incomplete Random Sets	en
dc.type	Journal Article	en
dc.identifier.doi	10.1017/bsl.2013.3	en
pubs.issue	01	en
pubs.begin-page	80	en
pubs.volume	20	en
dc.description.version	Pre-print	en
dc.rights.holder	Copyright: Association for Symbolic Logic	en
pubs.end-page	90	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en
pubs.subtype	Article	en
pubs.elements-id	461046	en
pubs.org-id	Science	en
pubs.org-id	School of Computer Science	en
dc.identifier.eissn	1943-5894	en
pubs.record-created-at-source-date	2015-01-23	en