Turing Completeness § Group: 5 #group-5 Relations § Undecidability: Turing completeness is a concept related to undecidability and the ability to simulate any computation.