✳flâneur — a map of the web's best reading

Accidentally Turing-Complete

beza1e1.tuxen.de · 1,784 words · saved by 1 readers

Stuff which is somehow limited (stack overflows, arbitrary configuration, etc) is still considered Turing complete, since all "physical" Turing machines are resource limited. Although they were initially not supposed to, C++ templates are Turing-complete. For proof look at this paper (pdf). In a very similar fashion to C++, the type system of TypeScript can be used to implement a prime check. Although Java set out to fix the errors of C++, it also fell into Turing-completeness eventually. Radu Grigore built a parser generator for fluent interfaces. The paper mov is Turing-complete starts as this: It is well-known that the x86 instruction set is baroque, overcomplicated, and redundantly redundant. We show just how much fluff it has by demonstrating that it remains Turing-complete when reduced to just one instruction. It inspired movfuscator, the single instruction C compiler. Building on this, there is a branchless, mov-only version of the classic DOOM video game. This is thought to be

Some things were not supposed to be Turing-complete . This is a collection of such accidents. Stuff which is somehow limited (stack overflows, arbitrary configuration, etc) is still considered Turing complete, since all "physical" Turing machines are resource limited. C++ Templates Although they were initially not supposed to, C++ templates are Turing-complete. For proof look at this paper (pdf) . TypeScript Type System In a very similar fashion to C++, the type system of TypeScript can be used to implement a prime check . Java Generics Although Java set out to fix the errors of C++, it also f

Explore this link on the map →

saved by

related reading