The automata theoretic roots of process algebra. Sequential functions How ISO C lost the plot and became unsuitable for operating systems
Papers



The automata theoretic roots of process algebra. Sequential functions How ISO C lost the plot and became unsuitable for operating systems

See also: Von Neumann’s critique of automata theory and logic in computer science

These papers introduce sequential functions for specifying digital systems like operating systems and networks. The mathematical basis comes from Moore machines, Moore machine products, and primitive recursive functions on finite sequences. Primitive recursive functions on sequences were described by Rózsa

One of the most important Computer Science papers introduced finite state machine language recognizers, the equivalence between non-deterministic and deterministic finite automata (in terms of what languages they recognize) , the Myhill congruences, etc.

Al Gore really did have a pivotal role in the development of the Internet and the incessant and ignorant jeering from the media on this issue did no favors to the American public. From https://web.eecs.umich.edu/~fessler Here is the definitive statement
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 starts with 0. This is
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 exit. The
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 claimed that Fischer, Lynch, Patterson (FLP) “theorem” on networks shows