In computability theory, a system of data-manipulation rules is said to be Turing-complete or computationally universal if it can be used to simulate any ...
確定! 回上一頁