Lecture notes on Paxos
PAXOS – (c) Victor Yodaiken, 2022 These are the lecture notes, or see the paper. 1. Really clever distributed consensus algorithm by Leslie Lamport A. Infamously hard to understand - but not...
View ArticleProcess algebra and automata theory
Milner’s Communication and Concurrency contrasts a notion of “bisimulation” with what he characterizes as the view in standard automata theory. Standard automata theory, however, has a much more...
View ArticleUnforgivable C programming 1
As many people never tire of explaining, the C language is obsolete, unsafe, unwelcome in polite company and generally looked down on by thought leaders and adepts of λ calculus alike. Here’s a...
View ArticleMathematics 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 computer science. It is often...
View Articledon’t defer
There is a proposal to add “defer” to C. Its biggest example is taken from code that was originally designed to not manage storage at all, but to run once and exit – delegating all the cleanup to...
View ArticleKuth’s Merge Sort in C
Taken from Knuth Algorithm S mergesort P162-163 Vol 3 Second edition 1998 The major change is that the scratch buffer is not required to be adjacent and there are some changes because C array indexing...
View ArticleAl Gore and the Internet
From https://web.eecs.umich.edu/~fessler Here is the definitive statement on Gore's involvement in "inventing" the Internet, from the guys who really did:...
View Article