-
An Effective Procedure for Computing "Uncomputable" Functions
We give an effective procedure that produces a natural number in its out...
02/05/2013 ∙ by Kurt Ammon, et al. ∙
0
∙
share
read it
-
A Formalization of the Turing Test
The paper offers a mathematical formalization of the Turing test. This f...
05/27/2010 ∙ by Evgeny Chutchev, et al. ∙
0
∙
share
read it
-
A recursion theoretic foundation of computation over real numbers
We define a class of computable functions over real numbers using functi...
10/02/2020 ∙ by Keng Meng Ng, et al. ∙
0
∙
share
read it
-
Beyond Turing Machines
This paper discusses "computational" systems capable of "computing" func...
07/23/2009 ∙ by Kurt Ammon, et al. ∙
0
∙
share
read it
-
Are Minds Computable?
This essay explores the limits of Turing machines concerning the modelin...
10/13/2011 ∙ by Carlos Gershenson, et al. ∙
0
∙
share
read it
-
Betwixt Turing and Kleene
Turing's famous 'machine' model constitutes the first intuitively convin...
09/03/2021 ∙ by Dag Normann, et al. ∙
0
∙
share
read it
-
Recursed is not Recursive: A Jarring Result
Recursed is a 2D puzzle platform video game featuring treasure chests th...
02/12/2020 ∙ by Erik Demaine, et al. ∙
0
∙
share
read it
Set Turing Machines
03/25/2021 ∙ by Garvin Melles, et al. ∙
0
∙
share
We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.
READ FULL TEXT
Comments
There are no comments yet.