ELab Team

Feb 7, 2021 · Fundamentals

How to Prove JavaScript and TypeScript Are Turing‑Complete Using Partial Recursive Functions

This article explains why implementing partial recursive functions is equivalent to Turing‑completeness, defines the basic functions and operations of partial recursion, demonstrates how common arithmetic can be built from them, and provides JavaScript and TypeScript code that formally proves both languages are Turing‑complete.