Turing Completeness
Igor Guerrero
Playlist
1:27:25
10 Tracks
Nov 18, 2015
1
In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be…