A great tutorial from ratfactor about the editing semantics of sam

Really approachable intro to using constraint solving systems.

A video tutorial for the factor programming language

This book provides an introduction to Conway’s Game of Life, the interesting mathematics behind it, and the methods used to construct many of its most interesting patterns. Lots of small “building block”-style patterns (especially in the first four or so chapters of this book) were found via brute-force or other computer searches, and the book does not go into the details of how these searches were implemented. However, from that point on it tries to guide the reader through the thought processes and ideas that are needed to combine those patterns into more interesting composite ones.

Part of the appeal in Julia is that it’s designed to be a high-performance language for scientific computing. Like other scientific languages (e.g., R, Matlab, etc) it has 1-based indexing rather than 0-based indexing (Python, C , etc). Julia code is automatically compiled giving you performance that is comparable to compiled languages like C , without the hassle of actually having to deal with the compiler yourself. But we’ve all heard the sales pitch for Julia before, there’s no need for me to repeat it here, and anyway I kinda just want to dive into the code.

You’ll find here a walkthru of what will eventually be all the glyphs in Dyalog APL, in an order where no glyph is used in an example until it’s been introduced. So far there’s no prose – the explanations are purely through examples for now (but we’ll add prose later).

A really excellent educational document from Greg Wilson for folks who wanna learn sql.

A very detailed, approachable clerk notebook that gives an overview of clojure’s semantics

3blue1brown, or 3b1b for short, is primarily a YouTube channel about discovery and creativity in math. On this site, you can find written versions of many of these lessons, often with more interactive elements sprinkled in.

This is for study of programming in array languages such as APL 502, J 48, BQN 55, and K 44, as well as array-oriented features of other languages and notation such as einstein notation, numpy broadcasting, mathematica’s threaded 38. We may even get into discussions of combinatory logic 63.

To find this path we can use a graph search algorithm, which works when the map is represented as a graph. A is a popular choice for graph search. Breadth First Search is the simplest of the graph search algorithms, so let’s start there, and we’ll work our way up to A.

quick expiration and demonstration of the uiua stack based array programming language

This is a tutorial about writing a broughlike (a small roguelike game similar to 868-HACK or Cinco Paus) from scratch in JavaScript.

The project is a multi-user dungeon, a text adventure game that allowsplayers to connect over the network. Players can wander from room toroom, and pick up and drop items. For the purpose of this exercise,there is no need to make the items useful. Players can speak to otherplayers in the same room.

The project is a multi-user dungeon, a text adventure game that allowsplayers to connect over the network. Players can wander from room toroom, and pick up and drop items. For the purpose of this exercise,there is no need to make the items useful. Players can speak to otherplayers in the same room.

The site contains all the lectures, project materials and tools necessary for building a general-purpose computer system and a modern software hierarchy from the ground up.The materials are aimed at students, instructors, and self-learners. Everything is free and open-source, as long as you operate in a non-profit, educational setting.

a brief but detailed exploration of the UF/uxn internals

general sort of overview for learning Clojure, haven’t actually read through it yet

In terms of implementation, though, it is far from simple. Lambda calculus has variables, which introduce huge complexity into the interpreter: especially if you want to do any kind of formal reasoning about programs, this complexity is a problem. We might want to reach for something even lower-level than lambda calculus: this is where combinator calculi come in.

In this book, you won’t just see how to use regex in a regex testing tool like regexpal or regex101. You’ll also see how they works in JavaScript. This is what many courses and tutorials tailored for regex in JavaScript lack. As you see how they work using a regex tester, you’ll also see how they work in JavaScript.