Explain the following terminology (12 points) 1. Computable function2. Decidable language3. Universal Turing Machine 4. Accept Computing History 5...

1 Computable function: refers to a function that satisfies certain conditions and can be implemented using an algorithm. 2. Decidable language: refers to the language that can determine whether a statement is true within a limited number of steps. 3. Universal Turing machine: It is an abstract computing model based on Turing machine, which can simulate any computer program. 4. Accept calculation history: It is a calculation model that can record multiple calculation steps, simulate these calculation steps, and derive new calculation steps. 5. Polynomial time reduction: refers to the process of converting a problem into another equivalent problem in polynomial time. 6. NP completeness: refers to a problem that cannot be solved in polynomial time, but can be solved in a non-polynomial time way.