Introduction - Chapter 0

0.0(0)
Studied by 2 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/14

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 3:07 PM on 9/18/24
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

15 Terms

1
New cards

Punch Cards

Early form of data storage and automation used to control weaving patterns in automated looms.

2
New cards

Joseph Jacquard

Inventor of punch cards for automating the weaving process.

3
New cards

Ada Lovelace

Recognized as the world's first programmer for writing algorithms for the Analytical Engine.

4
New cards

Analytical Engine

An early mechanical general-purpose computer designed by Charles Babbage in the 1830s.

5
New cards

Blaise Pascal

Inventor of the Pascaline, the first gear-based machine for addition and subtraction.

6
New cards

Pascaline

A mechanical calculator designed specifically for performing addition and subtraction.

7
New cards

Kurt Gödel

Mathematician known for the incompleteness theorem, which states that some true statements cannot be proven in complex systems.

8
New cards

Incompleteness Theorem

Gödel's theorem highlighting limits of formal systems and algorithms.

9
New cards

Tim Berners-Lee

Inventor of the World Wide Web, proposed in 1989 for linking documents over the Internet.

10
New cards

World Wide Web

A revolutionary concept for sharing and accessing information globally through linked documents.

11
New cards

John von Neumann

Named after the architect of the von Neumann architecture model for computers.

12
New cards

Von Neumann Architecture

A computer architecture model where a single storage holds both instructions and data.

13
New cards

Alan Turing

Proposed the Turing machine, a theoretical model of computation.

14
New cards

Turing Machine

An abstract machine that manipulates symbols on tape according to rules, used to understand computation limits.

15
New cards

Church-Turing Thesis

Proposes that any function solvable by an algorithm can be computed by a Turing machine, foundational for computational limits.