Inductive Thinking — Mathematical Foundations of Computer Science

Tags

Top Highlights

• If you made a good hypothesis, you would predict the correct answer.

• You are making a generalization, but it might not be right

• generalize the information

• looking at a subset of observations at drawing a general conclusion

• limited information and make your best generalization.

• formal inductive reasoning we will make generalizations that must be true for the situation in question

• how we verify our observations generalize

• base case is a specific point of data we know the answer to

• If you made a flawed hypothesis you would predict the wrong answer.

• generalized the information you had to the jelly beans you didn’t know about

• justify why

• Turing Machine

• simple computer that can do anything that a computer can do

• any algorithm that can be run on a general purposed computer

• Turing Completeness

• Any program that can simulate a Turing Machine can run any algorithm a general purpose computer can

• confidence about the generalization

• needed one program that worked on both systems

• definative prediction

• decision tree is a collection of questions that is used to make a decision.