Generic algorithms for halting problem and optimal machines revisited

DOI10.2168/LMCS-12(2:1)2016zbMath1448.03027arXiv1505.00731OpenAlexW3101918022WikidataQ57349380 ScholiaQ57349380MaRDI QIDQ2800974

Damien Desfontaines, Alexander Shen, Laurent Bienvenu

Publication date: 19 April 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.00731

zbMATH Keywords

Kolmogorov complexitygeneric algorithmshalting problemoptimal enumerations

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10) Algorithmic randomness and dimension (03D32)

This page was built for publication: Generic algorithms for halting problem and optimal machines revisited