Tag
DhravyaShah announces supermemory's architecture for a Turing-complete context system for AI agents, supporting ingestion, retrieval, learning, profiles, filtering, and file systems via multiple interfaces.
Unicode's transliteration rules (UTS #35) are proven to be Turing-complete by compiling 2-tag systems, showing termination is undecidable. This result affects the ICU library used in many systems.
This article demonstrates building a perceptron and NAND gates inside the game Age of Empires II, arguing that changing the substrate of an LLM alters perception of attributes and critiquing research on LLM anthropomorphism.
A deep dive into the limitations of regex for parsing HTML, inspired by the famous Stack Overflow answer, discussing formal language theory and the power of industrial regex engines.
Grid Programs proposes a two-dimensional grid programming model where instructions are placed on a grid, and a pointer controls the flow by moving up, down, left, and right, without the need for variable names. It has been proven Turing complete, opening up new design spaces for visual programming, cellular automaton hardware, and code obfuscation.
A Cornell ECE4760 course project demonstrates that the RP2040 microcontroller's DMA subsystem is Turing complete, building a functional fetch-execute CPU entirely out of DMA channel operations without involving the ARM cores.
This article provides a proof that Jira's automation features are Turing-complete by implementing a Minsky register machine using Jira issues and automation rules.
A PyTorch library that compiles neural networks from Turing machine descriptions, enabling exact simulation without training.
A collection of fun and obscure software facts, including Tetris implemented in Conway's Game of Life, Vim being Turing complete, and the history of the backslash character.