Alternatives
Products that do what Bubble sort on a Turing machine does
Bubble sort is pretty simple in most programming languages ... what about on a Turing Machine? I used all three of Claude 4.6, GLM 5, and GPT 5.2 to get a result, so this exercise was not quite trivial, at least at this time. The resulting machine, bubble_sort_unary.yaml, will take this input: 111011011111110101111101111 and give this output: 101101110111101111101111111 I.e., it's sorting the array [3,2,7,1,5,4]. The machine has 31 states and requires 1424 steps before it comes to a halt. It also introduces two extra symbols onto the tape, 'A' and 'B'. (You could argue that 0 is also an…
- 1IM
This is the first iteration of a short game I’m making that tries to interactively explain some of my favorite math questions / ideas. My goal is mostly to get the player curious and not necessarily to explain absolutely everything. There were a lot of fun technical parts to building this: - For implementation reasons, it’s much easier if the lines all have integer intersection points with each other. To do this, when a new line is added I “cheat” by rounding intersections to integers and then splitting the old lines at the intersection into new linds (with potentially different slopes)…
2024 · rahulilango.com
- 2IQ
2017 · illustrated-algorithms.now.sh
- 3
- 4IM
This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).
2024 · github.com
- 5SP
2019 · wtracy.gitlab.io
- 6AR
Hey HN! I've been curious about the history of computer science and decided to try to read Turing's 1936 paper where he conceptualizes the Turing Machine, etc. I had trouble understanding the paper, read The Annotated Turing by Charles Petzold (which is wonderful), but felt that reading a reference implementation would help formalize my understanding. When I couldn't find an open source implementation, I decided to write my own. The implementation includes: - Abbreviated tables (m-functions) - Conversions to Standard Descriptions and Description Numbers - A working universal machine - A…
2023 · github.com
- 7FS
I want to share a really dumb, but very practical project I have packaged this summer, to perform operations on strings much faster. I was using Python to work with a multi-terabyte newline-delimited file. Reading, splitting, and shuffling it was a nightmare. So, I wrapped a trivial hardware-friendly heuristic I've been using for the last few years into a CPython library. The part I enjoyed the most is implementing SIMD behavior without SIMD instructions... Using 64-bit words to work at 8-bit granularity. Unlike conventional SIMD, the code would remain the same for ~~almost~~ any hardware.…
2023 · ashvardanian.com
- 8
- 9SL
This is a small plugin I made for Simon Willison's llm utility. You can do things like: cat names.txt | llm sort -q "Which one of these names is best for a pet seagull?" cat books.txt | llm sort -q "Which book is more related to basic vs. advanced CS topics?" I see a lot of potential marrying LLMs with classic UNIX interfaces.
2025 · github.com
- 10AA
I started writing this book 10 years ago in JavaScript, got through a few chapters (asymptotic notation, basic techniques, start of sorting), and then abandoned it. Recently I picked it back up, converted everything to TypeScript, and used AI (Zenflow [1] + Claude Opus 4.6) to complete the remaining chapters. I provided the structure, direction, and initial chapters; the AI generated the bulk of the remaining content under a spec-driven workflow. The book covers roughly a first 1-2 year CS curriculum: sorting, dynamic programming, graph algorithms, trees, heaps, hash tables, and more. All…
Mar 2026 · amoilanen.github.io
- 11CI
Author: Danison Nuñez Project: Coderive Project Type: Programming Language Highlight: Formula-based Execution ## Coderive - Iterating Through 1 Quintillion in a Loop *Subtitle: How a phone interpreter achieves what supercomputers cannot* The Impossible Loop: ```java // In any other language, this would be computational suicide for i in [0 to 1Qi] { // 1,000,000,000,000,000,000 iterations arr[i] = i * i } ``` Traditional Reality: · Python: MemoryError at array creation · Java/C++: Theoretical 31 years (with 8 exabytes of RAM) · NumPy/TensorFlow: Immediate crash ·…
Dec 2025 · github.com
- 12AU
Paper (PDF): https://github.com/shudv/deltasort/blob/main/paper/main.pdf I’ve been exploring a variant of the sorting problem where the sort routine knows about which indices were updated since the previous sort. This situation arises in many practical systems: large sorted lists that are read frequently, updated in small batches, and where the update pipeline already knows which positions changed (e.g., UI lists, leaderboards). Despite this most systems either re-sort the entire array or apply independent binary insertions or perform…
Jan 2026 · github.com
- 13AS
2013 · github.com
- 14OA
I made an early version of a sorted collection library for Zig. Sorted collections are data structures that maintain the data in sorted order. Examples of these data structures are `java.util.TreeMap` in Java and `std::map` in C++. These data structures are mainly used for fast lookups (point search) and fast range searches. The library is available on GitHub: https://github.com/CogitatorTech/ordered
Oct 2025
- 15A2
I’ve been experimenting with structured logic as a way to frame search spaces — not in an academic way, just as a personal project. I wanted to know: what happens if you initialize a brute-force run with a simple equality like xy = x / y? Not as a filter, just as a logical ignition point. I used AES-256-CBC encrypted files with UUID passwords and tested against a 1 million UUID space. It cracked it in under 40 seconds. Then I scaled it to a 1 billion UUID range, and it still found the key without issue. This isn’t a crypto tool, and I’m not trying to solve any cryptographic problems.…
2025 · github.com
- 16YC
2024 · github.com
- 17EC
Hey everyone! I just launched Essentials-C, a minimal C library with handy functions for string and array manipulation – built from scratch with simplicity and learning in mind. Highlights: - `length`, `reverse`, `substring`, `trim`, `replaceChar`, etc. - `bubbleSort`, `includes`, `startsWith`, `endsWith`, and more - Pure C, no external dependencies - Clean, readable code – great for beginners and power users I’m building it to be the “Essentials” of every C project — feel free to contribute or suggest features! GitHub: https://github.com/oileo/Essentials-C Feedback is…
2025 · github.com
- 18BS
I like small puzzle games to play on my mobile, (because you can put them away easily as well). But I got really annoyed that a lot of them force feed you advertisements. To counter this I made my own puzzle game, as a progressive web app. This means you can install it on your mobile or desktop as an application, and play offline. After the game is offline ready, no requests should be outgoing except checking for updates of the game. So there is no tracking/reporting going on. This also means I rely on old fashion email to get feedback! The game is build in React + Typescript + Vite,…
2024 · matthijsgroen.github.io
- 19IV
2017 · caspervonb.github.io
- 20UL
2024 · github.com
- 21TW
Dec 2025 · github.com
- 22PS
Mar 2026 · github.com
- 23MP
2017 · min-lang.org
- 24
Ranked by how close each launch is in meaning, then by votes. Refine with a description →