Academics

  /  

Courses

  /  

Descriptions

COMP_SCI 396, 496: Introduction to Kolmogorov Complexity

VIEW ALL COURSE TIMES AND SESSIONS

Prerequisites

COMP_SCI 335 or 336

Description

Kolmogorov complexity uses computer science to measure the amount of information (or randomness) contained in finite objects. In addition to being interesting philosophically, Kolmogorov complexity can be fruitfully applied to a variety of topics. This course provides an introduction to this theory, with a minimum of prerequisites. This course will also cover applications of Kolmogorov complexity to various fields, including computational complexity theory, algorithms and combinatorics. 

REFERENCE TEXTBOOKS: N/A
REQUIRED TEXTBOOK: N/A

COURSE COORDINATORS: Donald Stull

COURSE INSTRUCTOR : Prof. Donald Stull

COURSE GOALS: