Computing halting probabilities from other halting probabilities
type: Item
instance of: scholarly article
title: Computing halting probabilities from other halting probabilities
zbMATH Open document ID: 1355.68083
author: George Barmpalias
author: Andrew E. M. Lewis
published in: Theoretical Computer Science
publication date: 2016-12-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1602.06395
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D32
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 6668233
zbMATH Keywords: algorithmic randomness
zbMATH Keywords: halting probability
zbMATH Keywords: bounded computations
zbMATH Keywords: Chaitin's omega
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2283473154
arXiv ID: 1602.06395
cites work: Q3377732
cites work: Universality probability of a prefix-free machine
cites work: Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Incompleteness theorems for random reals
cites work: Recursively enumerable reals and Chaitin \(\Omega\) numbers
cites work: Q4520520
cites work: Q4081221
cites work: Algorithmic Randomness and Complexity
cites work: RELATIVIZING CHAITIN'S HALTING PROBABILITY
cites work: Randomness and universal machines
cites work: Randomness and recursive enumerability
cites work: The definition of random sequences
cites work: Chaitin Ω Numbers and Halting Problems
DOI: 10.1016/J.TCS.2016.11.013
description: scientific article