I CSI 101- Midterm Exam Guide - Comprehensive Notes for the exam ( 56 pages long!)

86 views56 pages

Document Summary

A set of steps that defines how a task is performed. How to find prime numbers: before a machine can perform a task, it needs to have instructions such that it can understand them, program: a representation of an algorithm. Programs are written on paper or displayed on a screen for humans. 0-2: in a sense, the intelligence required to solve a problem is encoded in the algorithm, the intelligence displayed by machines is limited by the intelligence that can be conveyed through algorithms. If no algorithm exists for solving a problem, then the solution of that problem lies beyond the capabilities of a machine to solve it: g del"s incompleteness theorem (1930): some problems cannot be solved by algorithms. The study of algorithm capabilities was the beginning of the field know today as of computer science. History of computing: today"s computers have an extensive genealogy, early computing devices.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents