- MathNotebook
- MathConcepts
- StudyMath
- Geometry
- Logic
- Bott periodicity
- CategoryTheory
- FieldWithOneElement
- MathDiscovery
- Math Connections
Epistemology
- m a t h 4 w i s d o m - g m a i l
- +370 607 27 665
- My work is in the Public Domain for all to share freely.
- 读物 书 影片 维基百科
Introduction E9F5FC
Questions FFFFC0
Software
See: Automata, Multiplication
Describe computer automata, Turing machines, computability theory and the arithmetical hierarchy in terms of category theory.
- Consider the setting of the values on a tape for a Turing machine as given by a natural transformation where each cell is an object. Consider the cells as objects and changing of values as morphisms.
Consider a category of cells (were morphisms are the paths between them).
Consider a category of cell values {0,1}.
Consider maps from a cell to its possible entries (O,1).