What does the term: Turing-complete mean Turing-complete refers to a property of a computational system or programming language that demonstrates its ability to perform any calculation that a Turing machine can do. A Turing machine is a hypothetical computing device that can simulate any algorithm by reading and writing symbols on an infinite tape. Being Turing-complete means that a system or language can solve any problem that is computationally solvable. It can handle loops, conditionals, and other control structures necessary for performing complex calculations. This term is often used in the context of programming languages to indicate their capability to express any computation. # References ```dataview Table title as Title, authors as Authors where contains(subject, "Turing-complete") ```