Antonín Kučera












            ******************************************************************************************

            * Doc. RNDr. Antonín Kučera, CSc.
            ******************************************************************************************
            Associate Professor


            kucera(zavinac)mbox.ms.mff.cuni.cz [ MAIL "kucera(zavinac)mbox.ms.mff.cuni.cz"]


            Welcome (at your own risk)






            ******************************************************************************************
            * Teaching
            ******************************************************************************************


            • NTIN064 Computability I
            • NTIN065 Computability II

            • NTIN073 Recursion Theory I
            • NTIN074 Recursion Theory II






            ******************************************************************************************
            * Selected publications
            ******************************************************************************************


            • Kučera A., Nies A. Demuth randomness and computational complexity, Annals of Pure and Ap
              pp.504–513, Elsevier, 2011

            • Kučera A., Nies A. Demuth's path to randomness, Lecture Notes in Computer Science, 7160,
              Elsevier, 2012
            • Kučera A., Slaman T. Low upper bounds of ideals, Journal of Symbolic Logic, 74 (2), pp.5

              2009
            • Kučera A., Slaman T. Turing incomparability in Scott sets., Proc. Amer. Math. Soc., 135 
              pp.3723-3731, AMS, 2007

            • Kučera A., Terwijn S. Lowness for the class of random sets, Journal of Symbolic Logic, 6
              pp.1396-1402, ASL, 1999
            • Kučera A., Slaman T. Randomness and recursive enumerability, SIAM J. Computing, 31(1), p

              2001
            • Kučera A. An alternative, priority-free, solution to Post problem, Lecture Notes in Comp
              233, pp.493 - 500, Springer Verlag, 1986

            • Kučera A. Measure, PI-1(0)-classes and complete extensions of PA, Lecture Notes in Mathe
              pp.245-259, Karger, 1985
            • Kučera A. On relative randomness, Annals of Pure and Applied Logic 63(1), pp.61-67, Else

            • Kučera A. Randomness and generalizations of fixed-point free functions, Lecture Notes in
              1432, pp.245-254, Springer Verlag, 1990
            • Hájek P., Kučera A. On recursion theory in I-Sigma-1, Journal of Symbolic Logic, 54 (2),

              ASL, 1989
            • Kučera A. On the use of diagonally nonrecursive functions, Studies in Logic and the Foun
              Mathematics, vol. 129 (Logic Colloquium'87), pp.219-239, Elsevier, 1989

            • Kučera A. On the role of O' in Recursion Theory, Studies in Logic and the Foundatio
              Mathematics Volume 124, (Logic Colloquium '86), pp.133-141, Elsevier, 1987
            • Demuth O., Kučera A. Remarks on 1-genericity, semigenericity and related concepts, Comm.

              Carolinae, 28(1), pp.85-94, , 1987
            • Demuth O., Kučera, A. Remarks on constructive mathematical analysis, Studies in Logic an
              Foundations of Mathematics, vol. 97(C), pp.81-129, Elsevier, 1979