while (n–->42) { std::cout << n; }

Latest Articles

Cinder Climb

My project for a climbing wall. Although in principle a climbing wall is not necessary.

High throughput Fizz Buzz

https://codegolf.stackexchange.com/questions/215216/high-throughput-fizz-buzz/

Multiplication

https://gmplib.org/manual/Toom-3_002dWay-Multiplication.html#Toom-3_002dWay-Multiplication   • Basecase Multiplication • Karatsuba Multiplication • Toom 3-Way Multiplication • Toom 4-Way Multiplication • Higher degree Toom’n’half • FFT Multiplication • Other Multiplication • Unbalanced Multiplication

Analyzing Japanese with Natural Language Processing and Go

“One of the most exciting things about learning a foreign language is developing a proficiency for reading it. At first, sentences in the foreign languages start off as intimidating blocks of text, totally opaque and meaningless. With lots of practice, single words start to make sense here and there. A basic understanding of the language’s […]

Optimizations enabled by -ffast-math

https://kristerw.github.io/2021/10/19/fast-math/

PlayStation 3 Architecture

https://www.copetti.org/writings/consoles/playstation-3/

Music

Music recommendations. Nils Frahm and others

Necessary-disorder tutorials

Tutorial blog for the blog www.necessary-disorder.tumblr.com by Etienne Jacob. https://necessarydisorder.wordpress.com/

Awesome talks – aggregator site

https://awesometalks.party/

Fibonacci Hashing: The Optimization that the World Forgot (or: a Better Alternative to Integer Modulo)

https://www.reddit.com/r/programming/comments/8rlr3a/fibonacci_hashing_the_optimization_that_the_world/e0sic25/