Antonín Kucera

According to our database, Antonín Kucera authored at least 11 papers between 1986 and 2015.

Collaborative distances:

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

2015

Demuth's Path to Randomness.

Antonín Kucera, André Nies, Christopher P. Porter

Bull. Symb. Log., 2015

2014

Computing k-Trivial Sets by Incomplete Random Sets.

Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky

Bull. Symb. Log., 2014

2013

Joining non-low C.E. sets with diagonally non-computable functions.

Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky

J. Log. Comput., 2013

2012

Demuth's Path to Randomness.

Antonín Kucera, André Nies

Proceedings of the Computation, Physics and Beyond, 2012

2011

Demuth randomness and computational complexity.

Antonín Kucera, André Nies

Ann. Pure Appl. Log., 2011

2009

Low upper bounds of ideals.

Antonín Kucera, Theodore A. Slaman

J. Symb. Log., 2009

2001

Randomness and Recursive Enumerability.

Antonín Kucera, Theodore A. Slaman

SIAM J. Comput., 2001

1999

Lowness for The Class of Random Sets.

Antonín Kucera, Sebastiaan Terwijn

J. Symb. Log., 1999

1993

On Relative Randomness.

Antonín Kucera

Ann. Pure Appl. Log., 1993

1989

On Recursion Theory in I Sigma₁.

Petr Hájek, Antonín Kucera

J. Symb. Log., 1989

1986

An Alternative, Priority-Free, Solution to Post's Problem.

Antonín Kucera

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986