1.Logic%20Intro[1]

1.Logic%20Intro[1] - Great Ideas n Alan Turing n n What is...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Great Ideas n Alan Turing – n What is computable? n A task is computable if one can specify a sequence of instructions which when followed will result in the completion of the task. n John Von Neumann – n Stored program concept n Developed the concept of storing a program in the computer’s memory rather than it’s circuitry Copyright © 2008 by Helene G. Kershner
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Great Ideas n Technological advances n Vacuum tube f transistor & integrated circuits (multiple n Microprocessor chip – computer on a chip n High level programming language – people can build “user Friendly” soFtware” n Changes in memory device hardware n Storing inFormation digitally, making use oF the concept that computers work with two states: on/oFF, 1/0, yes/no, high current/low current n The computer is a binary machine Copyright © 2008 by Helene G. Kershner
Background image of page 2
Great Ideas n The computer is a binary machine n Perform mathematics n Perform operations on letters that form words n Represent images in grayscale and color n Represent sound Copyright © 2008 by Helene G. Kershner
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
The computer is a binary machine Copyright © 2008 by Helene G. Kershner
Background image of page 4
Boolean Logic / Boolean Algebra n Boolean Algebra (Boolean Logic) is an algebra for symbolically representing problems in logic & analyzing them mathematically. n Based on work of George Boole n English mathematician n An Investigation of the Laws of Thought n Published in 1854 n Reduced logic of human thought to mathematical operations n An analysis of how natural language works if it were logical Copyright © 2008 by Helene G. Kershner
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
n In 1938 Claude E. Shannon of MIT n Showed that Boolean logic could be applied to the design of relay networks in telephone systems (the ability to switch signals from one place to another automatically) n Invented branch of mathematics called Information Theory n Information Theory applied Boolean algebra to certain engineering problems systems n Today, boolean algebra, as applied to computer logic design is also known as Switching Theory. Copyright © 2008 by Helene G. Kershner
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 27

1.Logic%20Intro[1] - Great Ideas n Alan Turing n n What is...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online