How much information = How many yes/no questions

Simon and dad were having a discussion about how difficult it is to solve a 3×3 blindfolded and whether that requires a different set of skills than simply solving a … Continue reading How much information = How many yes/no questions

The Never Ending Cycle

Simon here. I notice I have basically been absent for the past month or two. Let me explain. I have basically fallen in a cycle that goes like this: I … Continue reading The Never Ending Cycle

“I have made a game in a game!”

Simon has succeeded in making a playable game using another game as a programming language. He created a clone of Fight using Baba Is You, currently one of his favorite … Continue reading “I have made a game in a game!”

Predictions and Plans

Late December is always a great time to dream about the future. How fast will the internet become? What will be the actual speed our future data will travel? Below … Continue reading Predictions and Plans

Esolangs

Simon’s new craze is esolangs (esoteric programming languages), programming languages designed to be “weird”. For example, there are esolangs designed to be minimalistic (like brainf*** (yes, that is an actual … Continue reading Esolangs

All 256 Elementary Cellular Automata

Simon has returned to his beloved Cellular Automata theme and created this nice sequence comprising all the 256 elementary rules. You can access his code at https://editor.p5js.org/simontiger/sketches/gECh5tVwa Simon explains: Every … Continue reading All 256 Elementary Cellular Automata

Integration Techniques for Physics Simulations

Simon has made a visual about what he calls “three different ways to make a physics simulation”: Blue: Modified Euler Integration (aka Backward Euler Integration); Green: Euler Integration (aka Forward … Continue reading Integration Techniques for Physics Simulations

Conway’s Game of Life

Simon’s version of John Conway’s famous Game of Life, a cellular automaton zero-player game whose evolution follows certain simple rules and mainly depends on its initial conditions. Cellular automata-like models … Continue reading Conway’s Game of Life

NAND to Tetris with hardware: Problem Solving

Reading on in the From NAND to Tetris textbook. I realized I have a problem. One RAM chip only has one address but will have to be connected to three … Continue reading NAND to Tetris with hardware: Problem Solving

Simon’s sketch book, P vs. NP and Fallacy vs. Paradox

Simon took a piece of paper and drew P vs. NP and other complexity classes. P vs. NP is probably the most famous millennium problem, one of the seven most … Continue reading Simon’s sketch book, P vs. NP and Fallacy vs. Paradox

Further plans about the NAND to Tetris project

One thing I don’t like about From NAND to Tetris is that they don’t explain sequential logic, like at all. They basically say: “Here’s a D flip-flop, don’t worry about … Continue reading Further plans about the NAND to Tetris project

Nandgame!

Thanks to @BioGeek in the comments, Simon has discovered nandgame.com, one awesome computer engineering learning environment, corresponding to the first five chapters of the NAND to Tetris course (see our … Continue reading Nandgame!