How Does Alphabetical Order Drive Computation
An esoteric programming language called Folders treats directory structures as executable code, where the arrangement and nesting of folders define program logic rather than traditional syntax. Created in 2015 by Daniel Temkin, also known for Rivulet and Velato, Folders operates on the principle that folder names are irrelevant except for their alphabetical order, making containment and hierarchy the sole carriers of meaning. Updated as recently as 2026, it stands among forty-four documented esolangs that challenge conventional coding paradigms by using filesystem organization as a computational medium.
Breaking news
Town AI Secures $108 Million Series B, Valued at $1 Billion After $55 M Pre‑Series
Apple Prepares for Major Product Launch Event on October 28
Apple Releases Release Candidates for watchOS, tvOS and visionOS 27.2
Apple Limits iPhone Duo and iPhone 18 Pro Max to Reservation-Only Sales in Japan and South KoreaFolders redefines programming by shifting focus from textual commands to spatial relationships within a file system. Programs are written by creating folders in specific sequences and hierarchies, with execution driven by traversing these structures according to alphabetical sorting rules. Since folder names are ignored beyond their order, developers must rely solely on positional logic—such as which folder contains another or the sequence of siblings—to encode operations. This approach turns the operating system’s directory tree into a state machine, where depth, branching, and order correspond to instructions, loops, and data manipulation. The language assumes infinite drive space, allowing unbounded recursion and complex data structures through deep nesting. Temkin designed Folders to explore the minimal conditions under which computation can emerge, questioning whether syntax is necessary at all when semantics can be derived purely from arrangement.
Can a Language Without Text Still Be Practical
In Folders, the alphabetical ordering of sibling folders determines the sequence of execution, effectively turning a list of directories into a programmed instruction stream. For example, a folder named „Afollowed by ”Bmight trigger one operation, while „Bbefore ”Acould reverse it, depending on the interpreter’s rules. This mechanism allows branching and looping to emerge from simple renaming or repositioning of folders, enabling conditional logic without explicit statements. The interpreter scans directories in sorted order, assigning meaning to each based on context and depth, much like reading a tape in a Turing machine. Because names themselves are disregarded, two programs can look identical in naming but behave differently if their order changes—a feature that emphasizes process over representation. This design forces programmers to think in terms of permutations and hierarchies rather than symbols, offering a radical abstraction of what it means to write code.
While Folders is primarily a theoretical exploration, its implications touch on broader questions about the nature of programming and human-computer interaction. By removing text entirely, it highlights how much of coding relies on symbolic representation that could, in theory, be replaced by structural or spatial alternatives. Though impractical for everyday use due to the overhead of managing thousands of folders, Folders serves as a thought experiment in minimalism, showing that computation can arise from order alone. It invites reflection on whether future interfaces might leverage spatial As of 2026, Temkin continues to reference Folders in discussions about esolangs as artistic and philosophical statements, underscoring their role in expanding the boundaries of what we consider a programming language.
How does a program actually run in Folders? The interpreter examines the file system starting from a root directory, processes folders in alphabetical order at each level, and assigns computational meaning based on depth, containment, and sequence—effectively turning directory traversal into instruction execution.
Frequently Asked Questions
Is it possible to write useful algorithms in Folders? Yes, in theory: simple arithmetic, loops, and conditional logic can be encoded through nested folder structures, though the resulting systems are often vastly larger and slower than their text-based counterparts due to filesystem overhead.
Why ignore folder names if they’re usually meaningful in operating systems? Folders deliberately strips semantic value from names to isolate the computational power of hierarchy and order, proving that naming is not essential to computation—only relative positioning matters.
