19.2. Chapter 19 - Concept Summary¶
Chapter 19 included the following concepts from computing.
Abstraction - Abstraction is used to remove unnecessary details. For example, after you create a procedure or function and test it, you can call it without having to think about how it works.
Conditional - A conditional allows for code to be executed when a condition is true.
Halting Problem - Alan Turing proved that it is not possible to decide algorithmically whether a given Turing machine will ever halt.
Turing Machine - A Turing machine is a theoretical computer that can read instructions from a tape and write results to the tape.
This is the end of chapter 19. We would love it if you could give us some feedback on this chapter at https://www.surveymonkey.com/r/ch19-student-fb. You might want to open this link in a new tab to make it easier for you to return to your place in this ebook.