Zobrazeno 1 - 10
of 9 929
pro vyhledávání: '"halting problem"'
Autor:
Passamonti, Massimo
In this essay, I argue that explicit ethical machines, whose moral principles are inferred through a bottom-up approach, are unable to replicate human-like moral reasoning and cannot be considered moral agents. By utilizing Alan Turing's theory of co
Externí odkaz:
http://arxiv.org/abs/2407.16890
Autor:
Hamkins, Joel David, Nenu, Theodor
We discuss the accuracy of the attribution commonly given to Turing's 1936 paper "On computable numbers..." for the computable undecidability of the halting problem, coming eventually to a nuanced conclusion.
Comment: 18 pages. Commentary may be
Comment: 18 pages. Commentary may be
Externí odkaz:
http://arxiv.org/abs/2407.00680
We propose a new language feature for ML-family languages, the ability to selectively unbox certain data constructors, so that their runtime representation gets compiled away to just the identity on their argument. Unboxing must be statically rejecte
Externí odkaz:
http://arxiv.org/abs/2311.07369
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We study the parameterized complexity of the problem to decide whether a given natural number $n$ satisfies a given $\Delta_0$-formula $\varphi(x)$; the parameter is the size of $\varphi$. This parameterization focusses attention on instances where $
Externí odkaz:
http://arxiv.org/abs/2211.06121
Autor:
Dudenhefner, Andrej
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (December 8, 2023) lmcs:9977
Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing machine immortality (existenc
Externí odkaz:
http://arxiv.org/abs/2208.13428
Autor:
Andrej Dudenhefner
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing machine immortality (existenc
Externí odkaz:
https://doaj.org/article/cae125669d774f50a7f1da230ae9db6c
Autor:
Daylight, Edgar G.1 (AUTHOR) egdaylight@dijkstrascry.com
Publikováno v:
Computability. 2021, Vol. 10 Issue 2, p141-158. 18p.
Autor:
Calude, Cristian S.1 (AUTHOR) cristian@cs.auckland.ac.nz, Dumitrescu, Monica2 (AUTHOR) mdumi@fmi.unibuc.ro
Publikováno v:
Computability. 2020, Vol. 9 Issue 2, p155-166. 12p.
Autor:
SHOJAEI-FARD, Ali shojaeifa@yahoo.com
Publikováno v:
Bulletin of the Transilvania University of Braşov: Series III Mathematics & Computer Science. 2022, Vol. 64 Issue 1, p139-158. 20p.