7.17. Self Check¶
You have attempted of activities on this page
Q-1: Several CAs are Turing complete, this means they can compute any computable function. What is this property called?
Q-2: If you wanted to make a hypotheses that could never be proven wrong you would want to make a hypothesis.
Q-3: If you make a simple model more realistic it will not become more reliable.