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

View Full Document Right Arrow Icon
1 COMPLEXITY THEORY CSci 5403 LECTURE I: BASICS Undergrad Graduate 4-5 courses/semester 2 courses/semester 3 hrs/week/credit Not necessarily “base of knowledge” research prep Complexity theory studies the inherent limitations of computing with bounded resources, such as: Time Space Spacetime Parallel time Number of random bits Interaction Ominiscient Advice Communication Because we are interested in what cannot be done, we use tools of mathematics and logic: proofs. This course is not about: “Counting steps” {bits, etc…} (We will do a lot of it, though.) How to write proofs (If you can’t do them already, drop.) Non-linear dynamics (try the math or statistics departments.)
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 GRADING 8 HOMEWORKS – 40% 4 TAKE HOME EXAMS – 40% 3 HW SOLUTIONS – 20% HOMEWORK 8 Times per semester: Homework will be due at the start of lecture. New Homework will be posted on the web. Each Homework is 5 questions. You may choose to work in groups of up to 3. Every homework must be typeset using LaTeX. Question grading scale: 0 – No significant understanding 1 – “right idea” but important gaps 2 – basically correct Grade translation: A = 62-80, B=50-61, C = 38-49 EXAMS 4 Take-Home exams – dates already set Each exam is 1 question. Posted at noon, due in 48 hours. Worst exam score dropped.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/21/2011 for the course CSCI 5403 taught by Professor Sturtivant,c during the Spring '08 term at Minnesota.

Page1 / 7


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

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