Set Turing Machines
From MaRDI portal
Abstract: 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.
This page was built for publication: Set Turing Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6363764)
