Higher Type Recursion for Transfinite Machine Theory

P D Welch

doi:10.1007/978-3-030-22996-2_7

Higher Type Recursion for Transfinite Machine Theory

P D Welch

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

2 Citations (Scopus)

148 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 language	English
Title of host publication	Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings
Editors	Giuseppe Primiero, Barnaby Martin, Daniël Paulusma, Florin Manea
Publisher	Springer Verlag
Pages	72-83
Number of pages	12
Volume	11558
ISBN (Print)	9783030229955
DOIs	https://doi.org/10.1007/978-3-030-22996-2_7
Publication status	Published - 19 Jun 2019
Event	15th Conference on Computability in Europe, CiE 2019 - Durham, United Kingdom Duration: 15 Jul 2019 → 19 Jul 2019

Publication series

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

Conference

Conference	15th Conference on Computability in Europe, CiE 2019
Country/Territory	United Kingdom
City	Durham
Period	15/07/19 → 19/07/19

Keywords

Higher Type Recursion
Infinite Time Turing Machine
Transfinite Computation

Access to Document

10.1007/978-3-030-22996-2_7

Full-text PDF (accepted author manuscript)
This is the accepted author manuscript (AAM). The final published version (version of record) is available online via Springer Verlag at https://doi.org/10.1007/978-3-030-22996-2_7 . Please refer to any applicable terms of use of the publisher.
Accepted author manuscript, 116 KBLicence: Other

Handle.net

Persistent link

Cite this

Welch, P. D. (2019). Higher Type Recursion for Transfinite Machine Theory. In G. Primiero, B. Martin, D. Paulusma, & F. Manea (Eds.), Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings (Vol. 11558, pp. 72-83). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11558 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-22996-2_7

Welch, P D. / Higher Type Recursion for Transfinite Machine Theory. Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings. editor / Giuseppe Primiero ; Barnaby Martin ; Daniël Paulusma ; Florin Manea. Vol. 11558 Springer Verlag, 2019. pp. 72-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2e13f2580348424195bd23b004cf44bd,

title = "Higher Type Recursion for Transfinite Machine Theory",

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.",

keywords = "Higher Type Recursion, Infinite Time Turing Machine, Transfinite Computation",

author = "Welch, {P D}",

year = "2019",

month = jun,

day = "19",

doi = "10.1007/978-3-030-22996-2_7",

language = "English",

isbn = "9783030229955",

volume = "11558",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "72--83",

editor = "Giuseppe Primiero and Barnaby Martin and Dani{\"e}l Paulusma and Florin Manea",

booktitle = "Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings",

address = "Germany",

note = "15th Conference on Computability in Europe, CiE 2019 ; Conference date: 15-07-2019 Through 19-07-2019",

}

Welch, PD 2019, Higher Type Recursion for Transfinite Machine Theory. in G Primiero, B Martin, D Paulusma & F Manea (eds), Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings. vol. 11558, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11558 LNCS, Springer Verlag, pp. 72-83, 15th Conference on Computability in Europe, CiE 2019, Durham, United Kingdom, 15/07/19. https://doi.org/10.1007/978-3-030-22996-2_7

Higher Type Recursion for Transfinite Machine Theory. / Welch, P D.
Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings. ed. / Giuseppe Primiero; Barnaby Martin; Daniël Paulusma; Florin Manea. Vol. 11558 Springer Verlag, 2019. p. 72-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11558 LNCS).

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

TY - GEN

T1 - Higher Type Recursion for Transfinite Machine Theory

AU - Welch, P D

PY - 2019/6/19

Y1 - 2019/6/19

N2 - 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.

AB - 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.

KW - Higher Type Recursion

KW - Infinite Time Turing Machine

KW - Transfinite Computation

UR - http://www.scopus.com/inward/record.url?scp=85069523216&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-22996-2_7

DO - 10.1007/978-3-030-22996-2_7

M3 - Conference Contribution (Conference Proceeding)

AN - SCOPUS:85069523216

SN - 9783030229955

VL - 11558

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 72

EP - 83

BT - Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings

A2 - Primiero, Giuseppe

A2 - Martin, Barnaby

A2 - Paulusma, Daniël

A2 - Manea, Florin

PB - Springer Verlag

T2 - 15th Conference on Computability in Europe, CiE 2019

Y2 - 15 July 2019 through 19 July 2019

ER -

Welch PD. Higher Type Recursion for Transfinite Machine Theory. In Primiero G, Martin B, Paulusma D, Manea F, editors, Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings. Vol. 11558. Springer Verlag. 2019. p. 72-83. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-22996-2_7

Higher Type Recursion for Transfinite Machine Theory

Abstract

Publication series

Conference

Keywords

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this