In computability theory, a system of data-manipulation rules is said to be Turing-complete ... For any characteristic of the program's eventual output, it is impossible ...
確定! 回上一頁