Schnorr triviality and genericity
type: Item
instance of: scholarly article
title: Schnorr triviality and genericity
zbMATH Open document ID: 1184.03040
author: Johanna N. Y. Franklin
publication date: 2010-03-15T00:00:00Z
Mathematics Subject Classification ID: 03D32
Mathematics Subject Classification ID: 03D28
zbMATH DE Number: 5681298
zbMATH Keywords: algorithmic randomness
zbMATH Keywords: Schnorr triviality
zbMATH Keywords: genericity
zbMATH Keywords: Turing degrees
zbMATH Keywords: \(K\)-trivials
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.2178/jsl/1264433915
OpenAlex ID: W1984336238
cites work: Calibrating Randomness
cites work: On Schnorr and computable randomness, martingales, and machines
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Classical recursion theory. Vol. II
cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability
cites work: Lowness properties and randomness
cites work: Schnorr trivial reals: a construction
DOI: 10.2178/JSL/1264433915
published in: Journal of Symbolic Logic
description: scientific article; zbMATH DE number 5681298