COT4210-Fall2011-Syll - COT 4210-01 Discrete Structures II...

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

View Full Document Right Arrow Icon
COT 4210-01 – Discrete Structures II - Fall 2011 Syllabus Class Time: Tuesday, Thursday 1:30-2:45pm Class Location: HEC – 118 Lecturer: Arup Guha Office: HEC – 240 Email: dmarino@cs.ucf.edu Phone Number: 407-823-1062 Office Hours: MW 2:15-3pm, 5-5:45pm, TR 11am-12pm, F 10:30-11:30am Course Web Page: http://www.cs.ucf.edu/courses/cot4210/fall2011/ Course Objective The true title of this course should be "Theory of Computation." We will examine different models of computation and determine their computational ability. For each model, we will look at specific problems that can be solved within a particular model of computation and other problems that can not be solved within that model. Our ultimate model will be the Turing Machine, which as far as any one knows, is a model as powerful as any computer that can be built, at least in terms of types of problems it can solve. (It's possible for a standard computer to solve problems faster than they could be solved on certain Turing Machine models, for example.) We will study which problems are solvable by a Turing Machine and which ones are not. Furthermore, we will differentiate between problems that
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

COT4210-Fall2011-Syll - COT 4210-01 Discrete Structures II...

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

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