Thorsten Kräling

According to our database, Thorsten Kräling authored at least 6 papers between 2009 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2014

Joins and Meets in the Partial Orders of the Computably Enumerable ibT- and cl-Degrees

Thorsten Kräling

PhD thesis, 2014

2013

The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent.

Klaus Ambos-Spies, Philipp Bodewig, Yun Fan, Thorsten Kräling

Ann. Pure Appl. Log., 2013

2010

Initial Segment Complexities of Randomness Notions.

Rupert Hölzl, Thorsten Kräling, Frank Stephan, Guohua Wu

Proceedings of the Theoretical Computer Science, 2010

2009

Quantitative Aspects of Speed-Up and Gap Phenomena.

Klaus Ambos-Spies, Thorsten Kräling

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Time-Bounded Kolmogorov Complexity and Solovay Functions.

Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Separations of Non-monotonic Randomness Notions.

Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009