Higher Type Recursion for Transfinite Machine Theory

Autor:	Philip D. Welch
Rok vydání:	2019
Předmět:	TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Machine theory Computability 010102 general mathematics Recursion (computer science) 0102 computer and information sciences Turing computability Computer Science::Computational Complexity Type (model theory) 01 natural sciences Algebra Turing machine symbols.namesake TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 010201 computation theory & mathematics Computability theory symbols Computer Science::General Literature 0101 mathematics Computer Science::Formal Languages and Automata Theory Mathematics Transfinite number
Zdroj:	Computing with Foresight and Industry ISBN: 9783030229955 CiE
DOI:	10.1007/978-3-030-22996-2_7
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5a6ba2ea0a05f66b59d36fa877c82e79 https://doi.org/10.1007/978-3-030-22996-2_7 Zobrazit plný text záznamu