{"version":"1.0","type":"link","title":"Turing complete - Newikis","description":"Turing complete is a term used in computability theory to describe abstract machines. These are usually called automata. An automaton is Turing complete if it can be used to emulate any Turing machine. It is also called computationally universal.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}