A. Learning content summary
The first chapter
learned hierarchical computing system, to understand the history and direction of the main applications of the computer, have a certain understanding of the computer daily direct or indirect contact. Understand the principles of early works such as the use of computers and the punch card machine.
Chapter XVIII
Understand how to check the error and computer error exists, to understand the big O analysis, software engineering and Turing machines and halting problem.
Issues relating to the teaching and learning process to solve
1. Why more time consuming than the factorial index time?
In this issue I have repeatedly encountered the teacher assigned topic, I read the books after many understand as N grows, mathematical factorial function can also be seen in the latter to be more rapid than the growth index, so its time will be longer.
2. do not understand what the problem Turing machine downtime
assumed downtime solvability, namely: the presence of Process H (P, I) for the program P can be determined whether shutdown when the input I is.
Let P be stopped at the input I, H output "stop", whereas the output of the "dead cycle" to derive contradictions
III. Learning progress
Read the front part of the "self-study is a craft," the slow progress, should be prepared plan, the provisions of the amount of reading every day to push myself.
For the teacher hundred lines of code per day arrangement is not completed.