Strong jump-traceability. II: \(K\)-triviality
type: Item
instance of: scholarly article
title: Strong jump-traceability. II: \(K\)-triviality
zbMATH Open document ID: 1273.03141
author: Rodney G. Downey
author: Noam Greenberg
published in: Israel Journal of Mathematics
publication date: 2013-11-01T00:00:00Z
Mathematics Subject Classification ID: 03D32
zbMATH DE Number: 6221729
zbMATH Keywords: \(K\)-triviality
zbMATH Keywords: algorithmic randomness
zbMATH Keywords: strongly jump-traceable set
MaRDI profile type: Publication
full work available at URL: s11856-011-0217-z
OpenAlex ID: W2170772460
cites work: Kolmogorov Complexity and Solovay Functions
cites work: Strong jump-traceability. I: The computably enumerable case
cites work: Completing pseudojump operators
cites work: Almost everywhere domination
cites work: Algorithmic Randomness and Complexity
cites work: Q4460833
cites work: Calibrating Randomness
cites work: Lowness properties and approximations of the jump
cites work: Characterizing the strongly jump-traceable sets via randomness
cites work: Benign cost functions and lowness properties
cites work: Pseudo Jump Operators. I: The R. E. Case
cites work: Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
cites work: Lowness for the Class of Schnorr Random Reals
cites work: Demuth randomness and computational complexity
cites work: Randomness and Computability: Open Questions
cites work: On strongly jump traceable reals
cites work: Lowness properties and randomness
cites work: Q3611832
cites work: Almost everywhere domination and superhighness
cites work: Q3418262
cites work: Computational randomness and lowness
DOI: 10.1007/S11856-011-0217-Z
description: scientific article; zbMATH DE number 6221729