# Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs

## TL;DR

This paper surveys classical solutions to interpret classical logic computationally, focusing on their connections to algorithms and programming from a modern perspective.

## Contribution

It re-examines epsilon calculus, modified realizability, and dialectica interpretation, highlighting their relevance to algorithms and programming today.

## Key findings

- Links classical logic interpretations to modern algorithms
- Highlights the computational relevance of epsilon calculus, realizability, and dialectica
- Provides a modern perspective on classical logic interpretations

## Abstract

The problem of giving a computational meaning to classical reasoning lies at the heart of logic. This article surveys three famous solutions to this problem - the epsilon calculus, modified realizability and the dialectica interpretation - and re-examines them from a modern perspective, with a particular emphasis on connections with algorithms and programming.