Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
Added this pointer:
An early discussion of automata via string diagrams in the Cartesian monoidal category of finite sets:
- Günter Hotz, Eine Algebraisierung des Syntheseproblems von Schaltkreisen, EIK, Bd. 1, (185-205), Bd, 2, (209-231) 1965 (part I, part II, compressed and merged pdf)
incuding that new compressed and merged pdf which I produced, as a service to the community.
I am copying over the following two references from Adamek’s fixed point theorem, assuming that they deserve to be listed here:
Jiří Adámek, Free algebras and automata realizations in the language of categories, Commentationes Mathematicae Universitatis Carolinae 15.4 (1974) 589-602 [eudml:16649]
Jiří Adámek, Věra Trnková, Automata and algebras in categories 37 Springer (1990) [ISBN:9780792300106]
added pointer to:
added pointer to:
Konrad Zuse: Rechnender Raum, Schriften zur Datenverarbeitung 1, Viehweg & Sohn (1969) [doi:https://doi.org/10.1007/978-3-663-02723-2, pdf]
English translation: Calculating Space, MIT Technical Translation, AZT-70-164-GEMIT (1970) [pdf]
reprinted as chapter 36 of: Hector Zenil (ed.) A Computable Universe – Understanding and Exploring Nature as Computation, World Scientific (2012) [doi:10.1142/8306]
1 to 4 of 4