The term Turing complete in computing refers to a system capable of performing any computation that can be defined algorithmically. A programming language or computational model is considered Turing complete if it can simulate a Turing machine, meaning it can execute a set of commands sufficient to solve any computational problem, given enough time and resources. This concept is foundational in understanding the limits and capabilities of computational systems.