» Turing Completeness

Turing Completeness

1936
  • Alan Turing
Computer science lab showcasing Turing completeness in programming languages.

A system of data-manipulation rules, such as a 编程语言, is Turing complete if it can simulate any single-taped Turing machine. This means it is computationally universal and can be used to solve any computable problem, given enough time and memory. Most general-purpose programming languages are Turing complete, forming the theoretical foundation for their expressive power.

Turing completeness is a concept from computability theory that defines the power of a computational system. It originates from Alan Turing’s 1936 paper describing a theoretical device known as the Turing machine. This machine consists of an infinitely long tape, a head that can read, write, and move along the tape, and a set of states and transition rules. Despite its simplicity, a Turing machine can perform any computation that can be described algorithmically. A programming language or any other formal system is deemed ‘Turing complete’ if it has the capability to simulate a universal Turing machine. This implies that the language can compute anything that is computable.

The core requirements for a system to be Turing complete are conditional branching (e.g., if-then-else statements) and the ability to loop indefinitely or recursively (e.g., while, for loops). These constructs allow the system to make decisions and repeat operations, which is sufficient to model the behavior of a Turing machine’s state transitions and tape manipulation. The Church-Turing thesis, a fundamental principle in computer science, posits that any function that is naturally considered ‘computable’ can be computed by a Turing machine. Therefore, a Turing-complete language is, in theory, capable of expressing any algorithm.

However, this theoretical power comes with a significant consequence: the halting problem. Turing proved that it is impossible to create a general algorithm that can determine, for all possible inputs, whether any given program will finish running or continue forever. This undecidability is an inherent property of all Turing-complete systems. For this reason, some domain-specific languages are intentionally designed to be non-Turing complete. For example, standard SQL and HTML are not Turing complete, which guarantees that their scripts or definitions will terminate and prevents them from entering accidental infinite loops, a desirable property for database queries and document rendering.

UNESCO Nomenclature: 1202
- 计算机科学

类型

抽象系统

中断

递增

使用方法

广泛使用

前体

  • Kurt Gödel’s work on incompleteness theorems
  • Alonzo Church’s development of lambda calculus
  • David Hilbert’s program to formalize mathematics
  • The concept of an algorithm dating back to antiquity

应用

  • general-purpose programming languages (python, c++, java)
  • spreadsheet systems with macro capabilities (e.g., excel with vba)
  • minecraft’s redstone circuitry
  • cellular automata like conway’s game of life
  • some advanced sql extensions with recursive common table expressions
  • the c++ template metaprogramming subsystem
  • css3 with certain html combinations

专利:

NA

潜在的创新想法

级别需要会员

您必须是!!等级!!会员才能访问此内容。

立即加入

已经是会员? 在此登录
Related to: turing completeness, turing machine, computability theory, alan turing, church-turing thesis, universal computation, algorithm, formal language, decidability, halting problem.

发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注

迎接新挑战
机械工程师、项目、工艺工程师或研发经理
有效的产品开发

可在短时间内接受新的挑战。
通过 LinkedIn 联系我
塑料金属电子集成、成本设计、GMP、人体工程学、中高容量设备和耗材、精益制造、受监管行业、CE 和 FDA、CAD、Solidworks、精益西格玛黑带、医疗 ISO 13485

我们正在寻找新的赞助商

 

您的公司或机构从事技术、科学或研究吗?
> 给我们发送消息 <

接收所有新文章
免费,无垃圾邮件,电子邮件不分发也不转售

或者您可以免费获得完整会员资格以访问所有受限制的内容>这里<

历史背景

(如果日期不详或不相关,例如 "流体力学",则对其显著出现的时间作了四舍五入的估计)。

相关发明、创新和技术原理

滚动至顶部

你可能还喜欢