Papers on automata theory and sequential functions The automata theoretic roots of process algebra. Large State Machines and Sequential functions Classic papers “Loop free
Read more
Von Neumann on the empirical roots of mathematics
See also: Von Neumann’s critique of automata theory and logic in computer science
Read more
Mathematics errors in computer science
A trivial theorem, more of a tautology, on networking and Turing’s deep theorem on decidability are both widely cited, widely misunderstood and widely misapplied in
Read more
Lecture notes on Paxos
PAXOS – (c) Victor Yodaiken, 2022 These are the lecture notes, or see the paper below 1. Really clever distributed consensus algorithm by Leslie Lamport
Read more
Sorting algorithms as recursive functions
This paper is an experiment in presenting programming algorithms as recursive functions, without pseudo-code or genuine code. The algorithms presented are the standard basic sorting
Read morePaxos demystified
Download
Read moreThe halting problem has nothing to do with computers
“Turing’s work was of course a great contribution to the world of mathematics, but there is a question of exactly how it is related
Read moreVon Neumann’s critique of automata theory and logic in computer science
These remarks from “THE GENERAL AND LOGICAL THEORY OF AUTOMATA” 1947 are enormously insightful – no surprise. Von Neumann essentially predicts the emergence of the
Read moreJudea Pearl’s mysterious claim
Pearl: Of course, but you cannot see this noble aspiration in scientific equations. The language of algebra is symmetric: If x tells us about y, then y tells us about x. I’m
Read moreTrees in informal methods
What’s a tree? First define a sequence or length n> 0 as a total map s: {1,.. n}→ X. Let Nil be the empty sequence.
Read more