• ms@ms.lt
• +370 607 27 665
• My work is in the Public Domain for all to share freely.

Introduction E9F5FC

Understandable FFFFFF

Questions FFFFC0

Notes EEEEEE

Software

Joseph Austin: I've been thinking that Computing itself can be treated somewhat axiomatically. As I've said before, there is a morphism of some sort between the Field Axioms with exponentiation, Finite Automata, and Structured Programs. For example, the Sequence, Decisions (choice) and Loops (repetition) in programming correspond to the sequence, choice, and repetition structures of regular languages which in turn correspond to product, sum, and power operations in arithmetic.

Multiplication

Naujausi pakeitimai

 Puslapis paskutinį kartą pakeistas 2016 birželio 25 d., 17:22