Computing K-Trivial Sets By Incomplete Random Sets
Login
University Home
→
Library
JavaScript is disabled for your browser. Some features of this site may not work without it.
Computing K-Trivial Sets By Incomplete Random Sets
Bienvenu, L
;
Day, AR
;
Greenberg, N
;
Kučera, A
;
Miller, JS
;
Nies, Andre
;
Turetsky, D
Identifier:
http://hdl.handle.net/2292/24252
Issue Date:
2014-03
Reference:
The Bulletin of Symbolic Logic, 2014, 20 (01), pp. 80 - 90
Rights:
Copyright: Association for Symbolic Logic
Rights (URI):
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
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.
Show full item record
Files in this item
Name:
1305.5514v1.pdf
Size:
394.2Kb
Format:
PDF
Description:
Submitted version
DOI:
10.1017/bsl.2013.3
This item appears in the following Collection(s)
Journal Articles
[23290]
Share
Search ResearchSpace
Search ResearchSpace
This Collection
Browse
All of ResearchSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Statistics
View Usage Statistics