Browse/search for people

Publication - Professor Philip Welch

    Higher Type Recursion for Transfinite Machine Theory

    Citation

    Welch, PD, 2019, ‘Higher Type Recursion for Transfinite Machine Theory’. in: Giuseppe Primiero, Barnaby Martin, Daniël Paulusma, Florin Manea (eds) Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings. Springer Verlag, pp. 72-83

    Abstract

    We look at some preliminary work in the theory of transfinite Turing machines generalised in the manner of Kleene to higher type recursion theory. The underlying philosophy is that ordinary Turing computability and inductive definability is replaced by the example here of Infinite Time Turing Machine computability and quasi-inductive definability.

    Full details in the University publications repository