##  [Turing Completeness](/turing-completeness) 

  ##  [Turing Completeness](https://natural.quantumdictionary.io/turing-completeness-0) 

  

 [![Natural & Formal Sciences Dictionary](/sites/default/files/styles/large/public/2026-01/Natural%20%26%20Formal%20Sciences.png.webp?itok=2kCDRVQv)](/topic-specific-dictionaries/natural-formal-sciences)



**Natural & Formal Sciences Dictionary**

 







 

 

 

 



 

 

 

 

Definition

A property of a computational system indicating it can simulate any general-purpose programmable machine and thus perform any computation that such an ideal machine can, given unbounded time and memory.