Computer Science, Mathematics and Programming in general
Shtetl-Optimized, The Blog of Scott Aaronson:
- Quantum computers are not known to be able to solve NP-complete problems in
polynomial time, and can be simulated classically with exponential slowdown.
- Link: http://www.scottaaronson.com/blog/
Bret Victor, Purveyor of impossible dreams:
Algorithmic Assertions - Craig Gidney’s Computer Science Blog:
Probably Done Before, The Blog of Daniel Eklund:
Math ∪ Code, The Blog of Sahand Saba:
The Blog of DANIEL WHITTAKER (CQRS):
The Blog of Pablo Castellano:
Elm
Rundis blog (Elm + Haskell):
LambdaCat blog (mostly Emacs + Elm but aslo Idris, Purescript, Phoenix, …):
- Trouble LambdaCat is a blog which explains visually and succinctly
interesting/useful/cool Functional Programming tidbits.
- Link:
http://www.lambdacat.com/
Ossi Hanhinen’s blog (Elm + Elixir):
Ricardo García Vega’s blog (Elm + Elixir):
F♯
Don Syme’s WebLog on F# and Related Topics :
Scott Wlaschin’s F# for fun and profit:
Sergey Tihon’s blog:
Tomas Petricek’s blog:
David Raab’s blog:
Ross McKinlay’s blog:
Rash’s (Steffen Forkmann) blog:
Mavnn’s blog: