Birs- 23w5039: Recursion Theory and its Applications

  1. Title:
    Extending Borel’s Conjecture from Measure to Dimension

    Speaker:

    Link:

  2. Title:
    Products do not preserve computable type

    Speaker:

    Link:

  3. Title:
    Automatic Structures

    Speaker:

    Link:

  4. Title:
    Compression of enumerations and gain

    Speaker:

    Link:

  5. Title:
    Effective presentations in effective topology and analysis

    Speaker:

    Link:

  6. Title:
    Maximal towers and ultrafilter bases in computability theory

    Speaker:

    Link:

  7. Title:
    Computable dualities and their applications

    Speaker:

    Link:

  8. Title:
    Reductions and (resolvable) combinatorial designs

    Speaker:

    Link:

  9. Title:
    Addition Machines and the Open Problems of Floyd and Knuth

    Speaker:

    Link:

  10. Title:
    COMPUTABILITY OVER FINITE TYPE OBJECTS

    Speaker:

    Link:

  11. Title:
    Consistency Checking for Algebraic Delay PDEs in Sequence Rings

    Speaker:

    Link:

  12. Title:
    Avoiding path-random trees

    Speaker:

    Link:

  13. Title:
    The computability aspect of extensions of abelian groups

    Link: