• Corpus ID: 232352473

Set Turing Machines

@article{Melles2021SetTM,
  title={Set Turing Machines},
  author={Garvin Melles},
  journal={ArXiv},
  year={2021},
  volume={abs/2103.14013}
}
In this paper we define a notion of Turing computability for class functions, i.e., functions that operate on arbitrary sets. We generalize the notion of a Turing machine to the set Turing machine. Set Turing machines operate on a class size tape. We represent sets by placing marks in the cells of the set Turing machine tape. Instead of being indexed by N or Z, the tapes cells are indexed by finite sequences of ordinals. For a marking of the cells to represent a set, the markings have the… 

Tables from this paper

References

SHOWING 1-3 OF 3 REFERENCES

Recursion in Higher Types, Handbook of Mathematical Logic

  • 1977

Primitive Recursive Set Functions, Proceedings of Symposia in Pure Mathematics, vol 13 part I

  • American Mathematical Society,
  • 1971