Category Archives: Lance Fortnow


Post proceedings

Announcement: Post Proceedings CCR 2016

CCR 2016 was a very successful meeting with lots of new ideas in algorithmic randomness and computability theory. We plan a post-proceedings volume in the journal Theory of Computing Systems.

Editors R. Downey, D. Hirschfeldt, and B. Kjos-Hanssen.

Deadline: 1 July 2016.

Papers related to the theme of the conference (not only from those who attended) will be considered. Normal TOCS standards of acceptance are applied. Early submission is encouraged and such papers will processed at time of submission. Submissions should be original research but high quality survey articles may be considered provided that they also contain significant original research.

Papers should be submitted to the site

using the article type

“S.I. : CCR 2016 – By Invitation Only”.

Please contact the Vithyaa Bathman (Vithyaa.Bathman [at], if you have any queries regarding the submission process.


Bounding rationality with computation

Tutorial speaker:
Lance Fortnow
Georgia Institute of Technology

Title: Bounding Rationality With Computation

Traditional microeconomic theory treats individuals and institutions as completely understanding the consequences of their decisions given the information they have available. These assumptions might require these agents to solve hard computational problems to optimize our choices. What happens if we restrict the computational power of economic agents?

There has been some work in economics treating computation as a fixed cost or simply considering the size of a program. This series of talks, based on the work of the speaker and others, will explore a new direction bringing the rich tools of computability and computational complexity into economic models.

We show how to incorporate computability and computational complexity into a number of economic models including game theory, prediction markets, forecast testing, preference revelation and awareness. We will suggest a number of further directions worth exploring.

We will not assume any background in economics or computational complexity.