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.

Parsiųstas iš http://www.ms.lt/sodas/Book/Multiplication

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