Thorsten Kräling

According to our database, Thorsten Kräling authored at least 6 papers between 2010 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

Initial segment complexities of randomness notions.

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

Inf. Comput., 2014

2013

Time-Bounded Kolmogorov Complexity and Solovay Functions.

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

Theory Comput. Syst., 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

2012

Separations of non-monotonic randomness notions.

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

J. Log. Comput., 2012

2010

Quantitative aspects of speed-up and gap phenomena.

Klaus Ambos-Spies, Thorsten Kräling

Math. Struct. Comput. Sci., 2010