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 can look at some algorithms for consensus and data consistency. No formal methods or category
Current reading: meltdown and spectre edition
Google project zero and then The two attacks. and remediation for Spectre in LLVM. Test code. (via Lobste.rs) Limits of ASLR. Spanner,True Time and CAP See also Synchronous Processors. and processor architecture. Some papers by Stephen Kell (also via lobste.rs
Types considered harmful II
Originally Nov 30, 2017. (revised 2021,2023) Russell introduced what is often viewed as his most original contribution to mathematical logic: his theory of types—which in essence tries to distinguish between sets, sets of sets, etc. by considering them to be
Bad ideas in type theory
Types as sets and subtypes as subsets. This may be due to confusing usage in mathematical practice where, for example, we often see references to integers as a subset of reals. But in mathematical usage, people generally understand that while
the 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. Crudely, the KR theorem extends Jordan-Holder \( (H_1 \triangleleft H_2 … \triangleleft H_n=G)\) to state