Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Merkle, Wolfgang
and
Stephan, Frank
2007.
On C-Degrees, H-Degrees and T-Degrees.
p.
60.
Jain, Sanjay
Stephan, Frank
and
Teutsch, Jason
2011.
Index sets and universal numberings.
Journal of Computer and System Sciences,
Vol. 77,
Issue. 4,
p.
760.
Kjos-Hanssen, Bjørn
Merkle, Wolfgang
and
Stephan, Frank
2011.
Kolmogorov complexity and the Recursion Theorem.
Transactions of the American Mathematical Society,
Vol. 363,
Issue. 10,
p.
5465.
Bauwens, Bruno
Makhlin, Anton
Vereshchagin, Nikolay
and
Zimand, Marius
2013.
Short Lists with Short Programs in Short Time.
p.
98.
Teutsch, Jason
2014.
Short lists for shortest descriptions in short time.
computational complexity,
Vol. 23,
Issue. 4,
p.
565.
Bienvenu, Laurent
Romashchenko, Andrei
Shen, Alexander
Taveneaux, Antoine
and
Vermeeren, Stijn
2014.
The axiomatic power of Kolmogorov complexity.
Annals of Pure and Applied Logic,
Vol. 165,
Issue. 9,
p.
1380.
Bauwens, Bruno
and
Zimand, Marius
2014.
Linear List-Approximation for Short Programs (or the Power of a Few Random Bits).
p.
241.
Liu, Lu
2014.
Cone avoiding closed sets.
Transactions of the American Mathematical Society,
Vol. 367,
Issue. 3,
p.
1609.
Teutsch, Jason
and
Zimand, Marius
2015.
On Approximate Decidability of Minimal Programs.
ACM Transactions on Computation Theory,
Vol. 7,
Issue. 4,
p.
1.
Teutsch, Jason
and
Zimand, Marius
2016.
A Brief on Short Descriptions.
ACM SIGACT News,
Vol. 47,
Issue. 1,
p.
42.
Jain, Sanjay
and
Teutsch, Jason
2017.
Enumerations including laconic enumerators.
Theoretical Computer Science,
Vol. 700,
Issue. ,
p.
89.
Bauwens, Bruno
Makhlin, Anton
Vereshchagin, Nikolay
and
Zimand, Marius
2018.
Short lists with short programs in short time.
computational complexity,
Vol. 27,
Issue. 1,
p.
31.
Ishkuvatov, Ruslan
and
Musatov, Daniil
2019.
Computing with Foresight and Industry.
Vol. 11558,
Issue. ,
p.
230.
Calude, Cristian S.
Jain, Sanjay
Merkle, Wolfgang
and
Stephan, Frank
2020.
Searching for shortest and least programs.
Theoretical Computer Science,
Vol. 807,
Issue. ,
p.
114.
Kjos-Hanssen, Bjørn
and
Liu, Lu
2020.
Extracting randomness within a subset is hard.
European Journal of Mathematics,
Vol. 6,
Issue. 4,
p.
1438.