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

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro