CMPT 120 Study Guide - Final Guide: Turing Completeness

• School: Simon Fraser University
• Department: Computing Science
• Course: CMPT 120
• Professor: Steven Pearce

Document Summary

The structures in a program that make programming tasks easier to implement; however they"re. Mini python: x = 0, to initialize variable x += 1, for arithmetic of adding one x = int(raw_input()), user input. Code necessary for simple tasks, to get solution. All programming languages are equivalent in terms of computational power, no advantage of one language over another in terms of problem solving ability. Any language as powerful as mini python is said to be turing complete. No, does not enabling writing of functions and not for describing data print x, user output list. append(x), append to list - function while x < y:, iteration - control structure.