COS 116: The Computational Universe Sanjeev Arora Spring 2011.

Slides:



Advertisements
Similar presentations
1 i206: Distributed Computing Applications & Infrastructure 2012
Advertisements

CSE 471/598 Introduction to Artificial Intelligence (aka the very best subject in the whole-wide-world) The Class His classes are hard; He is not.
What is Artificial Intelligence? What does it mean to talk about a program being “intelligent”? How will we know when we’ve succeeded?
Computer Science Professor Jennifer Rexford ’91.
1 Cankaya University Electronics and Communication Engineering Department ECE 425 Microprocessor I Course Outline Instructor: Assist. Prof. Dr. Orhan Gazi.
Introduction to Artificial Intelligence CSE 473 Winter 1999.
Engineering, Math, Physics EGR Introduction to Engineering First two weeks –Lecture from each of the six SEAS departments  COS, MAE, ELE, CEE,
CogSci 207: Week 0: Discussion Praveen Paritosh Thu, Sep 28, 2004.
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
Gödel’s Incompleteness Theorem and the Birth of the Computer Christos H. Papadimitriou UC Berkeley.
Self-reproducing programs. And Introduction to logic. COS 116: 3/6/2008 Sanjeev Arora.
Computer Science Professor Jennifer Rexford ’91.
Fall 2004 Cognitive Science 207 Introduction to Cognitive Modeling Praveen Paritosh.
Welcome to Psychology 437 Advanced Psychology Lab: Research Methods in Personality Psychology web page:
ECS15: Introduction to Computers Fall 2013 Patrice Koehl
Dr Rong Qu Module Introduction.
ECE 265 Introduction to Microcontroller Based Systems (A first course in computer architecture) 9/28/ ECE265.
CHEM 4531: Physical Chemistry II Spring 2011 J. M. Weber.
From Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora.
Studies in Big Data 4 Weng-Long Chang Athanasios V. Vasilakos MolecularComputing Towards a Novel Computing Architecture for Complex Problem Solving.
COS 116: The Computational Universe Adam Finkelstein Spring 2012.
Computer Network Fundamentals CNT4007C
Self-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein.
Introduction to the Theory of Computation
CS 1 •This is Computer Science 1. •Who is Professor Adams?
Additional Materials1 Other Languages C and C++: Languages used by Systems Programmers. Heavy use by Computer Scientists. COBOL: An ancient Business oriented.
Biologically Inspired computing Info rm atics luis rocha 2007 biologically-inspired computing.
An Introduction to Computer Science. CSE Studies How Computers Work and How to Make Them Work Better Architecture  Designing machines Programming languages.
Course Introduction Software Engineering
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
CSCD 434 Network Security Spring 2014 Lecture 1 Course Overview.
CS3518 Languages and Computability Kees van Deemter Lectures Monday14:00New King’s 14 Tuesday11:00KC T2 Tutorials/Practicals Tuesday13:00-15:00.
Introduction to the Theory of Computation Fall Semester, School of Information, Renmin University of China.
Computation & Machine, Ancient to Modern
Advanced Psychology Lab: Research Methods in Personality Psychology R. Chris Fraley
1 GEK1530 Frederick H. Willeboordse Nature’s Monte Carlo Bakery: The Story of Life as a Complex System.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Telling a robot how to behave Sanjeev Arora COS 116: Spring 2011.
Overview.  Explores the theoretical foundations of computing  What can and cannot be done by an algorithm  Most of the material predates computers!
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
CHEM 4531: Physical Chemistry II Fall 2011 J. M. Weber.
Agenda Course Introduction Video Typing for 20 minutes Copy portable software to your disk Typing Quiz History of computers c++ java, python, html, php,
History 398 Fall 2004 History 398Lecture 20 FROM ENIAC TO EDVAC.
Introduction to Computing BBA-I/BSCS-I Instructor: M. Mateen Yaqoob.
CSE 311 Foundations of Computing I Lecture 26 Cardinality, Countability & Computability Autumn 2011 CSE 3111.
COS 116: The Computational Universe Adam Finkelstein Spring 2010.
CMPT 308 — Computability and Complexity Fall 2004 Instructor: Andrei Bulatov, TA: Ramsay Dyer, Learning.
CSE 311 Foundations of Computing I Lecture 25 Pattern Matching, Cardinality, Computability Spring
CS 154 Formal Languages and Computability January 28 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron.
Computer Networks CNT5106C
Intelligent Control Methods Lecture 2: Artificial Intelligence Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Introduction: What is AI? CMSC Introduction to Artificial Intelligence January 7, 2003.
Spring, 2011 –– Computational Thinking – Dennis Kafura – CS 2984 Lambda Calculus Introduction.
Welcome to Data Structures. Course Introduction Instructor : r 신 용 태 r 愼 鏞 台 r Yongtae Shin r 정보과학관 422 호 r r r Homepage.
“... artificial intelligence [AI] is the science of making machines do things that would require intelligence if done by [humans]” (Minsky, 1963) ARTIFICIAL.
ISU AND YOUTHBUILD BRYAN HOSACK 12/07/2011 Introduction to Computing.
Economics 175 American Economic History
Theory of Computation. Introduction to The Course Lectures: Room ( Sun. & Tue.: 8 am – 9:30 am) Instructor: Dr. Ayman Srour (Ph.D. in Computer Science).
Introduction to Computing
Computer Network Fundamentals CNT4007C
Introduction to formal languages and automata
BASIC ELECTRONICS & ROBOTICS Instructor: Humayun Rashid Raahat
Introduction to Computing
Computer Networks CNT5106C
Lecture 1: Introduction
ECE 265 Introduction to Microcontroller Based Systems (A first course in computer architecture) 9/28/ ECE265.
What is AI course about? (Artificial Intelligence)
CPT S 317: Automata and Formal Languages
ENES 182 Engineering the Future
CS Problem Solving and Object Oriented Programming Spring 2019
Presentation transcript:

COS 116: The Computational Universe Sanjeev Arora Spring 2011

COS 116: The Computational Universe Instructor: Sanjeev Arora TA: Dominic Kao Lab  Wed 7:30-10:20pm, Friend 007  This week only: take-home lab Course homepage: ng11/cos116/ (copyrighted material on blackboard site)

Ancient dream: “Breathe life into matter” Philippe Semeria Golem (Jewish mythology) CIMA museum Automaton (Europe) Frankenstein (Shelley 1818) Robot (Capek 1920)

Breathing life into matter… NB: Military was a major sponsor of computational research in 20 th century

Computation strikes back….

“Breathe life into matter” – Another perspective

“Breathe life into matter” – A 20 th century perspective “Matter”: Atoms, molecules, quantum mechanics, relativity … “Life”: Cells, nucleus, DNA, RNA, … “Breathe life into matter”: Computation One interpretation: Make matter do useful, interesting things on its own

Computational Universe

Some important distinctions Computer Sciencevs. Computer Programming (Java, C++, etc.) Notion of computation vs. Specific implementation (Silicon, robots, Xbox, etc.)

No programming in this course! Not necessary for understanding More time for us to cover computer science (COS 116 broader than COS126!) No advantage to those who have prior programming experience

Brief history of computation Technological:  Mechanical Clocks (13 th century)  Clockwork “Automata”  Mechanized looms, steam engines  Vacuum tubes, electronic calculators ( ’s)  ENIAC (1945)  von Neumann Computer (1949, Princeton)  First PCs, 1970s

Brief history of computation Intellectual  Ancient Greeks, philosophers (How to “formalize thought”)  Boolean logic (G. Boole, )  Crisis in math Hilbert: Call to systematize math Gödel: Incompleteness theorem  Lambda calculus (A. Church, 1936)  Turing machines (A. Turing, 1937) Both at Princeton; First clear notion of “What is computation?” Wang tiles 1961

Computer Science: A new way of looking at the world

Example 1:

Example 2: Public closed-ballot elections Hold an election in this room  Everyone speaks publicly (no computers, , etc.)  End: everyone agrees on who won and margin  No one knows how anyone else voted Is this possible?  Yes! (A. Yao, Princeton)

Example 3: Computational Biology Old Biology New Biology Microarrays Pathways

COS 116 First 10 lectures:  Cool things computers do and how Next 8 lectures:  What’s inside computers, silicon chips, internet. Last 6 lectures:  Complexity, cryptography, viruses, search engines, artificial intelligence

This week’s lab: Web 2.0 (Take-home lab – will be posted by Tues night) This week’s reading: Brooks pp 12-21, pp (on blackboard)

Grading Midterm: 15% Final: 35% Lab reports: 35% Participation (class, blog): 15% Attendance expected at lectures and labs

Next couple labs: Scribbler. What determines its behavior?