7.16. Matching

Q-1:
• Cellular automaton (CA)
• A world model with very simple physics.
• Pseudo-random number generators (PRNGs)
• Produces seemingly random numbers.
• Turing complete
• Can compute any computable function.
• Cross-correlation
• Adding selected elements from an array.
• Falsifiability
• A demarcation between scientific hypotheses and pseudoscience
• Unfalsifiability
• A hypothesis that cannot be proven true or false based on observation or physical experiment.
• Church-Turing Thesis
• The claim that these definitions of computability capture something essential that is independent of any particular model of computation

You have attempted of activities on this page