340 research outputs found

    ジッスウ ノ シュウゴウロン ト ランダムネス ガイセツ ショウメイロン ト フクザツセイ

    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

    On New Notions of Algorithmic Dimension, Immunity, and Medvedev Degree

    Get PDF
    Ph.D

    Sequences with trivial initial segment complexity

    Get PDF
    corecore