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 moreLinked lists
What’s a linked list? Let V be a set of values and A be a set of “addresses”. Say a map f is a “linked
Read moreinformal methods applied to networks and timeouts
Distributed computation involves many interesting issues concerning shared data. Here I want to sketch out what networks look like using applied (informal) mathematics so we
Read moreSorting and groups
I can’t find much reference to this in the literature (see Maus for some hints and an interesting paper) , but surely people have looked
Read morestate equations in practice
When people think of mathematical models of state for programs and other computer systems, it’s natural and conventional to consider state as a map
Read moreState equations
Download paper. Unable to display
Read morePractical State Machines for Computer Software and Engineering
Download paper. [gview file=”https://www.yodaiken.com/wp-content/uploads/2016/01/practical.pdf”]
Read moremore on missed wakeup
Here are some conventions [Update: typos fix, Friday] We are concerned with state machines and sequences of events. The prefixes of a sequence include the
Read more