Explore >> Select a destination
|
You are here 
|
fredrikj.net | ||
| | | | |
bartoszmilewski.com
|
|
| | | | | This is part of the book Category Theory for Programmers. The previous instalment was Category: The Essence of Composition. See the Table of Contents. The category of types and functions plays an important role in programming, so let's talk about what types are and why we need them. Who Needs Types? There seems to be... | |
| | | | |
rjlipton.com
|
|
| | | | | Another proof idea using finite automata Steve Cook proved three landmark theorems with 1971 dates. The first has been called a "surprising theorem": that any deterministic pushdown automaton with two-way input tape can be simulated in linear time by a random-access machine. This implies that string matching can be done in linear time, which inspired... | |
| | | | |
jiggerwit.wordpress.com
|
|
| | | | | What follows are the opening paragraphs of a pdf document giving an argument for controlled natural languages in mathematics. At the recent Big Proof 2 conference in Edinburgh, I realized that a case must be made for developing a controlled natural language for mathematics. There is little consensus on this issue, and mathematicians and computer... | |
| | | | |
cronokirby.com
|
|
| | | - Read more: https://cronokirby.com/posts/2020/08/empty-vs-nonempty-groups/ | ||
