### informal 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 [...]

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 [...]

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 [...]

Mostly for my own amusement, I wanted to see if it was possible to specify basic sorting algorithms in ordinary algebra without ”formal methods” or either pseudo [...]

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, [...]

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 [...]

Two-way string matching And an implementation in Musl. The C standard post C11 The Rube-Goldberg approach to fault tolerance in NTPd which is not worse than PTP fault [...]

The Google manifesto is primarily a conservative political rant, not a scientific argument. Damore claims that any program to encourage hiring and promotion of women and [...]

Everyone can recognize some kinds of spurious reasoning – like the following: (A) Most programmers are not great. (B) Google tries to hire only excellent programmers [...]

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 at sorting as a problem in [...]

From the LLVM developer mailing list this remarkable exchange in which Chris Lattner of LLVM says that the compiler use of undefined behavior (UB) is so “crappy” [...]

Copyright © 2018 | MH Corporate basic by MH Themes