--- aliases: [] --- [Obsidian AVA](https://github.com/louis030195/obsidian-ava) AI generated tags: #computing #mathematic Last modified date: 2022-12-15 16:55 Commit: 1 Created at 2022-12-15 # [Anonymous feedback](https://www.admonymous.co/louis030195) # [[Epistemic status]] #shower-thought #to-digest # Related - [[en.wikipedia.org - Turing Completeness - Wikipedia]] - [[Halting problem]] - [[Entscheidungsproblem]] - [[Universal Turing Machine]] - [[Virtual Turing machine]] # TODO > [!TODO] TODO # Turing completeness Turing completeness is a term used to describe a system of rules that can be used to simulate any Turing machine. It is a measure of the computational power of a programming language or machine, and it is named after Alan Turing, the British mathematician who helped define the concept of the Turing machine. A Turing complete system is one that can be used to solve any problem that can be solved by a Turing machine. An [[Universal Turing Machine]] is complete if it can compute everything from the [[Organic reality]] [[Chiara Marletto - The Science of Can and Can't a Physicist's Journey Through the Land of Counterfactuals|Chiara Marletto]] makes an analogy of the differential equation for a Turing Machine as a "theoretical engine" that can take any input and generate any output. This engine is capable of simulating any Turing complete system, and is therefore Turing complete. In computer science, a language is said to be Turing complete if it has enough power to simulate a Turing machine. This means that it can recognize and execute a set of instructions for any given problem. To be considered Turing complete, a language must include a set of instructions for manipulating data, such as arithmetic and logical operations, as well as instructions for controlling the flow of the program, such as conditionals and loops. Examples of Turing complete languages include C, C++, Java, JavaScript, and Python.