ImaPenguin

Matrix fundamentals from the ground up. Definitions, the operations that matter, plain Python, numpy for comparison, and a complete BASIC program on a real C64.

Reservoir computing says don't train the dynamics, just train the readout. I used the SID's analog filter as the dynamics and one ridge regression as the readout. It's not state of the art, but the chip earns its keep exactly where a linear model falls ap

Eight CPUs from the 1970s and 1980s, sharing one 64K bus, an Apple-1 style monitor on the front, and a paper tape station. Open it in your browser and poke around.

Where the famous 43 quintillion comes from, why a C64 can't print it the easy way, and a tiny multi-precision multiplier in BASIC that gets every digit right.

I picked up a boxed Timex Sinclair 2068 that wouldn't boot. An oscilloscope, a BackBit tester, and a fresh Z80 later, it was running. Then I ported Charles Bond's 1981 maze algorithm from the C64 to Sinclair BASIC.

The fruit fly has a brain structure that acts like a hash function. I built it in Python, matched the 2017 paper's MNIST results against a classical baseline, then got the same algorithm running on a Commodore 64.

The Bombe needs a crib. What if you don't have one? Index of coincidence measures how much an output looks like real language vs random noise. We use it to attack Enigma without any known plaintext.

John Wallis found an infinite product for pi in 1655. Multiply enough fractions together and pi falls out. We run it on the C64 in BASIC and assembly, watching it converge one digit at a time.

Ring settings multiply Enigma's keyspace by 17,576. We add them to our C64 emulator, see why brute force alone can't keep up, and set the stage for smarter attacks.