Explore >> Select a destination
|
You are here 
|
www.pl-enthusiast.net | ||
| | | | |
www.jeremykun.com
|
|
| | | | | This post comes in preparation for a post on decision trees (a specific type of tree used for classification in machine learning). While most mathematicians and programmers are familiar with trees, we have yet to discuss them on this blog. For completeness, well give a brief overview of the terminology and constructions associated with trees, and describe a few common algorithms on trees. We will assume the reader has read our first primer on graph theory, which is a light assumption. | |
| | | | |
queuea9.wordpress.com
|
|
| | | | | Parametricity is a profound principle in the theory of programming languages -- but what kind of principle is it? To answer this, let me first recall the idea, as introduced by the great John C. Reynolds in his seminal paper "Types, Abstraction, and Parametric Polymorphism". (I wrote about this paper in an earlier post.) Suppose... | |
| | | | |
www.yodaiken.com
|
|
| | | | | ||
| | | | |
www.cryptofails.com
|
|
| | | Reasoning by Lego: The wrong way to think about cryptography. Scott Arciszewski from Paragon Initiative pointed me to this example of PHP cryptography. The code is bad and the crypto design is flawed,... | ||
