Higher Type Recursion for Transfinite Machine Theory

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

42 Downloads (Pure)

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.

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
PublisherSpringer Verlag
Pages72-83
Number of pages12
Volume11558
ISBN (Print)9783030229955
DOIs
Publication statusPublished - 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

Conference

Conference15th Conference on Computability in Europe, CiE 2019
CountryUnited Kingdom
CityDurham
Period15/07/1919/07/19

Keywords

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

Fingerprint Dive into the research topics of 'Higher Type Recursion for Transfinite Machine Theory'. Together they form a unique fingerprint.

Cite this