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

Before you keep reading...

Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.

Support Runestone Academy Today

Before you keep reading...

Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.

Support Runestone Academy Today

You have attempted 1 of 2 activities on this page