Explore >> Select a destination

You are here

 semantic.org
Sixteen Unusual Things About Pinafore | Semantic Dreams
| | argumatronic.com
argumatronic - The Nesting Instinct
15.1 parsecs away

Travel
| | Occasional writings about Haskell.
| | kuruczgy.com
Introduction to dependent types and the Curry-Howard isomorphism
12.8 parsecs away

Travel
| |
| | degoes.net
A Glossary of Functional Programming - John A De Goes
8.9 parsecs away

Travel
| | Functional programming has a bit of jargon, but that doesn't have to stop you from understanding core concepts
| | gilkalai.wordpress.com
To cheer you up in difficult times 25: some mathematical news! (Part 2) | Combinatorics and more
113.1 parsecs away

Travel
| Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP and in coNP. See this post, and updates there in the comment section. Topology seminar,...