Current research topics in computational complexity theory. Nondeterministic, alternating, probabilistic, and parallel computation models. Boolean circuits. Complexity classes and complete sets. The polynomial-time hierarchy. Interactive proof systems. Relativization. Definitions of randomness. Pseudo-randomness and derandomizations. Interactive proof systems and probabilistically checkable proofs. The topics for this course cover various aspects of complexity theory, such as the basic time and space classes, the polynomial-time hierarchy and the randomized classes. This is a pure theory class, so no applications were involved.
Subject:
Mathematics and Statistics, Science and Technology
The Art of the Probable" addresses the history of scientific ideas, in particular the emergence and development of mathematical probability. But it is neither meant to be a history of the exact sciences per se nor an annex to, say, the Course 6 curriculum in probability and statistics. Rather, our objective is to focus on the formal, thematic, and rhetorical features that imaginative literature shares with texts in the history of probability. These shared issues include (but are not limited to): the attempt to quantify or otherwise explain the presence of chance, risk, and contingency in everyday life; the deduction of causes for phenomena that are knowable only in their effects; and, above all, the question of what it means to think and act rationally in an uncertain world. Our course therefore aims to broaden students’ appreciation for and understanding of how literature interacts with--both reflecting upon and contributing to--the scientific understanding of the world. We are just as centrally committed to encouraging students to regard imaginative literature as a unique contribution to knowledge in its own right, and to see literary works of art as objects that demand and richly repay close critical analysis. It is our hope that the course will serve students well if they elect to pursue further work in Literature or other discipline in SHASS, and also enrich or complement their understanding of probability and statistics in other scientific and engineering subjects they elect to take.
This course provides a challenging introduction to some of the central ideas of theoretical computer science. Beginning in antiquity, the course will progress through finite automata, circuits and decision trees, Turing machines and computability, efficient algorithms and reducibility, the P versus NP problem, NP-completeness, the power of randomness, cryptography and one-way functions, computational learning theory, and quantum computing. It examines the classes of problems that can and cannot be solved by various kinds of machines. It tries to explain the key differences between computational models that affect their power.
This course provides practical instruction in the design and analysis of non-digital games. Students cover the texts, tools, references and historical context to analyze and compare game designs across a variety of genres, including sports, game shows, games of chance, card games, schoolyard games, board games, and role–playing games. In teams, students design, develop, and thoroughly test their original games to understand the interaction and evolution of game rules. Students taking the graduate version complete additional assignments.
" An historical examination and analysis of the evolution and development of games and game mechanics. Topics include a large breadth of genres and types of games, including sports, game shows, games of chance, schoolyard games, board games, roleplaying games, and digital games. Students submit essays documenting research and analysis of a variety of traditional and eclectic games. Project teams required to design, develop, and thoroughly test their original games."
No restrictions on your remixing, redistributing, or making derivative works.
Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some
restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make
derivative works.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based
educators, or other custom arrangements. Go to the resource provider to see
their individual restrictions.
