Skip to content

Higher Type Recursion for Transfinite Machine Theory

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publicationComputing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings
EditorsGiuseppe Primiero, Barnaby Martin, Daniël Paulusma, Florin Manea
Publisher or commissioning bodySpringer Verlag
Number of pages12
ISBN (Print)9783030229955
DateAccepted/In press - 19 Mar 2019
DatePublished (current) - 19 Jun 2019
Event15th Conference on Computability in Europe, CiE 2019 - Durham, United Kingdom
Duration: 15 Jul 201919 Jul 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11558 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th Conference on Computability in Europe, CiE 2019
CountryUnited Kingdom


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.

    Research areas

  • Higher Type Recursion, Infinite Time Turing Machine, Transfinite Computation


15th Conference on Computability in Europe, CiE 2019

Duration15 Jul 201919 Jul 2019
CountryUnited Kingdom

Event: Conference



  • Full-text PDF (accepted author manuscript)

    Rights statement: This is the accepted author manuscript (AAM). The final published version (version of record) is available online via Springer Verlag at . Please refer to any applicable terms of use of the publisher.

    Accepted author manuscript, 116 KB, PDF document

    Embargo ends: 19/06/20

    Request copy

    Licence: Other


View research connections

Related faculties, schools or groups