You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
dusko (Aug 11 2022 at 20:31):Categorical Computability in Monoidal Computer: Programs as Diagrams
https://arxiv.org/abs/2208.03817v1
This is a draft of the first 7 chapters of a textbook/monograph that presents computability theory using string diagrams. The introductory chapters have been taught as graduate and undergraduate courses and evolved through 8 years of lecture notes. The later chapters contain new ideas and results about categorical computability and some first steps into computable category theory. The underlying categorical view of computation is based on monoidal categories with program evaluators, called monoidal computers. This categorical structure can be viewed as a single-instruction diagrammatic programming language called Run, whose only instruction is called RUN.
[not sure if this is the right way to announce things. sorry if it is not. pls move if there is a better place.]
PS in view of the later chapters, now i think that a better title might be:
Programs as Diagrams in Monoidal Computer: from Categorical Computability to Computable Categories
John Baez (Aug 12 2022 at 00:34):Great! I should advertise this!