A \(K\)-trivial set which is not jump traceable at certain orders
type: Item
instance of: scholarly article
title: A \(K\)-trivial set which is not jump traceable at certain orders
zbMATH Open document ID: 1243.68196
published in: Information Processing Letters
publication date: 2012-07-25T00:00:00Z
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 6059705
zbMATH Keywords: algorithmic randomness
zbMATH Keywords: \(K\)-triviality
zbMATH Keywords: jump traceability
zbMATH Keywords: theory of computation
author: Daniel Turetsky
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.04.005
OpenAlex ID: W1978967735
cites work: Characterizing lowness for Demuth randomness
cites work: Strong jump-traceability. I: The computably enumerable case
cites work: Algorithmic Randomness and Complexity
cites work: Time-Bounded Kolmogorov Complexity and Solovay Functions
cites work: Lowness for the Class of Schnorr Random Reals
cites work: Lowness properties and randomness
cites work: Q3611832
cites work: Computational randomness and lowness
DOI: 10.1016/J.IPL.2012.04.005
description: scientific article; zbMATH DE number 6059705