The composition of this book has been for the author a long struggle of escape, and so must the reading of it be for most readers if the author’s assault upon them is to be successful,—a struggle of escape from
Process algebra is based on a misunderstanding of automata theory
See the current pdf in Arxiv Robin Milner’s book Communication and Concurrency involves a take on state machines that is fundamentally incorrect. “Now in standard automata theory, an automaton is interpreted as a language i.e. as a set of strings
More on Fischer, Lynch, Patterson and the parrot theorem.
I’m thinking about distributed consensus algorithms, timestamping, and databases and if you read that literature you will see many references to the Fischer, Lynch, Paterson “theorem”. Google Scholar tells me the paper has been cited more than 4500 times. The theorem
ESMA clarifies time sources for MiFID II
ESMA just released guidelines that reinforce what was already clear in the MiFIDII regulation – that GPS time is a perfectly acceptable source of “traceable” time. There is a lot else that is of interest in this report, but it’s
Practical State Machines for Computer Software and Engineering
Download paper. [gview file=”https://www.yodaiken.com/wp-content/uploads/2016/01/practical.pdf”]
Theories 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 in more detail the forms (of which the Turing machine is one) of substrate which
MiFID II, GPS and UTC time
I have a post up on FSMLabs web site about the use of GPS and other satellite time for MiFID II timestamp compliance. It’s fascinating how much effort has recently gone into trying to convince people that MiFID II will
Kirkhart’s conjecture
Is that there is some insight into the nature of primes that comes from considering the classes of numbers that share the same set of prime factors. For example 2x3x5 = 30, 4x3x5 = 60, 2x9x5 = 90, 2x3x25 =
Relaxed memory order
Two interesting posts on the order in which reads and writes happen and are made visible on shared memory multi-processors. X86 has a strong memory model in which if X=Y=0 and then processor core 1 writes 1 to X and
Algebra 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, vectors, groups, matrices, video , audio, or programs, algorithms or even proofs. When we try