CS6160 Theory of Computation
Problem Set 2
Department of Computer Science, University of Virginia
Gabriel Robins
Please start solving these problems immediately, and work in study groups. Please prove all your
answers; informal arguments are acceptable, b
The Turing Test
Q: Can machines think?
I compute,
therefore I am.
Problem: We dont know what think means.
Q: What is intelligence?
Problem: We cant define intelligence.
But, we usually know it when we see it.
The Turing Test
Q: Which of the following can
Computational Universality
Theorem: Many other systems are
equivalent to Turing machines.
cS aNbc | S
Grammars
-calculus
(X.X+1)
Post tag systems
A bc
-recursive functions
()(x,y) = z
Cellular automata
Boolean circuits
Diophantine equations
DNA
x3
Formal Languages: Review
Alphabet: a finite set of symbols
S=cfw_a,b
String: a finite sequence of symbols
ababbaab
Language: a set of strings
L=cfw_a,aa,aaa,
String length: number of symbols in it
|aba|=3
String concatenation: w1w2
abba=abba
Empty string:
CS6160 Theory of Computation
Solutions for Problem Set 1
Department of Computer Science, University of Virginia
Gabriel Robins
Please start solving these problems immediately, and work in study groups. Please prove
all your answers; informal arguments are
CS6160 Theory of Computation
Problem Set 3
Department of Computer Science, University of Virginia
Gabriel Robins
Please start solving these problems immediately, and work in study groups. Please prove all your
answers; informal arguments are acceptable, b
CS6160 Theory of Computation
Problem Set 1
Department of Computer Science, University of Virginia
Gabriel Robins
Please start solving these problems immediately, and work in study groups. Please prove all your
answers; informal arguments are acceptable, b
CS6160 Theory of Computation
Midterm Examination Fall 2013
University of Virginia
Gabriel Robins
This is a take-home open-book open notes pledged exam.
Note: while for your convenience the possession time of this exam is extended up to 24 hours,
the act
CS6160 Theory of Computation
Final Examination Fall 2013
University of Virginia
Gabriel Robins
This is a take-home open-book open notes pledged exam.
Note: while for your convenience the possession time of this exam is extended up to 24 hours,
the actua
SyllabusforCS125
Instructors:
JohnTortilla
Email:john.tortilla
@umiami.edu
TA:AndrewWang
CourseObjective:
The objective of this course is to expose students to a particular application of CS. This
particularmoduleexploresbrainstimulationtherapiesandhowthe
CS 291: Independent Study
Giorgio, Mark
Rooter: A Methodology for the Typical
Unification of Access Points and Redundancy
2 Related Work
The concept of event-driven configurations has been deployed before in the
literature [5]. The only other noteworthy w
CS 125
Refinement of Web Browsers
Ashrafokha, Alola and Giorgio
Abstract
The implications of metamorphic theory have been far-reaching and
pervasive. Given the current status of Bayesian modalities, experts
daringly desire the exploration of information r