Download paper. [gview file=”https://www.yodaiken.com/wp-content/uploads/2016/01/practical.pdf”]
Read moreTheories of abstract automata – Arbib
We have said that automata theory deals with the realization of partial functions F: X* —» Y* by some finitely specifiable substrate. Before we specify
Read moreAlgebra for computer science and function nesting
The fundamental mathematical basis of computer science is that code and data are the same things. A sequence of bits can represent real numbers, integers,
Read morePrimitive recursion over words
From: @book{Peter:1982:RFC:539249, author = {Peter, Roezsa}, title = {Recursive Functions in Computer Theory}, year = {1982}, isbn = {0470271957}, publisher = {Halsted Press},
Read morePointers draft
Despite pedants, pointers are useful and interesting and if you don’t understand them, you don’t really get what’s going on in a computer. Think of
Read moreFischer Lynch Patterson and timeouts
There is a widely cited (over 1400 cites in CiteseerX ) result called the Fischer-Lynch-Patterson theorem about consensus – a key issue in distributed databases or
Read moreA hard theorem becomes easy over time.
The basic result of the incompleteness proofs is pretty simple. The proofs are complicated because the idea was literally unthinkable until programming was invented. The
Read morethe terrible effect of Krohn-Rhodes
One of the most interesting theorems in computer science is the Krohn-Rhodes theorem that shows a strong link between basic computer science and group theory.
Read moreGödel’s Lost Letter
Gödel’s perspective in this letter is a refutation of the simplistic take on Turing’s proof seen so often in the computer science literature. In particular:
Read moreAre threads evil? (updated)
This paper by Prof. Edward Lee explains something of why “threads” are such a painful abstraction. As Prof. Lee notes, threads intrinsically create unspecified program
Read more