Thorsten Kräling

MaRDI QIDQ1944336zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees	2014-05-15	Paper
Initial segment complexities of randomness notions Information and Computation	2014-02-11	Paper
Time-bounded Kolmogorov complexity and Solovay functions Theory of Computing Systems	2013-04-15	Paper
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent Annals of Pure and Applied Logic	2013-04-05	Paper
Separations of non-monotonic randomness notions	2012-09-28	Paper
Separations of non-monotonic randomness notions Journal of Logic and Computation	2012-09-05	Paper
Quantitative aspects of speed-up and gap phenomena Mathematical Structures in Computer Science	2010-12-01	Paper
Initial segment complexities of randomness notions IFIP Advances in Information and Communication Technology	2010-10-27	Paper
Time-Bounded Kolmogorov Complexity and Solovay Functions Mathematical Foundations of Computer Science 2009	2009-10-16	Paper
Quantitative Aspects of Speed-Up and Gap Phenomena Lecture Notes in Computer Science	2009-06-03	Paper

Research outcomes over time

This page was built for person: Thorsten Kräling