Effectivity and reducibility with ordinal Turing machines
Work
Year: 2021
Type: article
Abstract: This article expands our work in (LNCS 9709 (2016), 225–233). By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility... more
Source: Computability
Author Merlin Carl
Institution Europa-Universität Flensburg
Cites: 23
Cited by: 3
Related to: 10
FWCI: 0.388
Citation percentile (by year/subfield): 51.97
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: green