Fifteen Eighty Four


Tag Archives: computability

Number of articles per page:

  • 5 Jul 2021
    Johanna N. Y. Franklin, Christopher P. Porter

    Algorithmic Randomness

    What does it mean for a sequence of 0s and 1s to be random? One way to answer this question is to use tools from mathematical logic, specifically computability theory: a sequence is random if it contains no regularities that can be detected by an idealized computer that has no time or space limitations.

    Read More

Number of articles per page: