6 research outputs found

    A new approach to formal language theory by Kolmogorov complexity (preliminary version)

    Get PDF

    Computability Theory

    Get PDF
    Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel’s Incompleteness Theorem, it has now blossomed into a rich area with strong connections with other areas of mathematical logic as well as algebra and theoretical computer science

    Variants of Partial Learning in Inductive Inference

    Get PDF
    Master'sMASTER OF SCIENC

    Effective Nonrecursiveness

    No full text
    corecore