Asynchronous into synchronous
Simon thinking about how to turn an asynchronous language into a synchronous language, using Sleepsort as a test.
a homeschooling blog about Simon, a young mathematician and programmer, and his little sister Neva. Visit https://simontiger.com
Simon thinking about how to turn an asynchronous language into a synchronous language, using Sleepsort as a test.
Simon has been mesmerised by this book for a couple of days by now, the Digital Computer Electronics eBook (third edition). He has downloaded it online and has been reading … Continue reading The Digital Computer Electronics book
This is Simon explaining Diffe-Hellman key exchange (also called DiffeHellman protocol). He first explained the algorithm mixing watercolours (a color representing a key/ number) and then mathematically. The algorithm allows … Continue reading The Diffe-Hellman key exchange algorithm
One more blog post with impressions from our vacation at the Cote d’Azur in France. Don’t even think of bringing Simon to the beach or the swimming pool without a … Continue reading Doing math and computer science everywhere
This is Simon’s introductory video for the World Science Scholars program (initiative of The World Science Festival). In May this year, Simon has been chosen as one of the 30 … Continue reading Simon introducing himself for the World Science Scholars program
Parts 1 and 2 in Simon’s new series showing him attempting to build an 8-bit computer from scratch, using the materials from Ben Eater’s Complete 8-bit breadboard computer kit bundle. … Continue reading Simon building an 8-bit Computer from scratch. Parts 1 & 2.
Simon solving the Ackermann function (a function that cannot be de-recursed). It’s computable but the computer’s soon runs out of its computing power (see the last line of code below):
Had great fun learning how to crack codes using Python! Simon is currently following the Programming with Python course on Brilliant.org and showed me how to see whether an encrypted … Continue reading Encoding and Cracking Codes in Python
Walking home from the swimming pool (where he and Neva had been jumping into the water exactly 24 times, calling out all the permutations of 1,2,3 and 4), Simon suddenly … Continue reading Why mathematics may become computer science
Simon writes: I’ve built a giant project; a website / community project / platform for making algorithms! I’ve built in this video Bubble Sort, Selection Sort, Insertion Sort, Mergesort, Quicksort, … Continue reading Simon’s new “giant project”: Sorting Visualizations
The photos below show Simon playing with Breadth-first search and Dijkstra’s algorithms to find the most efficient path from S to E on a set of graphs. The two more … Continue reading Pathfinding algorithms: Dijkstra’s and Breadth-first search