Set Turing Machines

03/25/2021
by   Garvin Melles, et al.
0

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

page 1

page 2

page 3

page 4

research
02/05/2013

An Effective Procedure for Computing "Uncomputable" Functions

We give an effective procedure that produces a natural number in its out...
research
05/27/2010

A Formalization of the Turing Test

The paper offers a mathematical formalization of the Turing test. This f...
research
10/02/2020

A recursion theoretic foundation of computation over real numbers

We define a class of computable functions over real numbers using functi...
research
07/23/2009

Beyond Turing Machines

This paper discusses "computational" systems capable of "computing" func...
research
10/13/2011

Are Minds Computable?

This essay explores the limits of Turing machines concerning the modelin...
research
09/03/2021

Betwixt Turing and Kleene

Turing's famous 'machine' model constitutes the first intuitively convin...
research
02/12/2020

Recursed is not Recursive: A Jarring Result

Recursed is a 2D puzzle platform video game featuring treasure chests th...

Please sign up or login with your details

Forgot password? Click here to reset