An historical overview of computational complexity is presented. Emphasis is on the
fundamental issues of defining the intrinsic computational complexity of a problem and …

Hallucination has been widely recognized to be a significant drawback for large language
models (LLMs). There have been many works that attempt to reduce the extent of …

This is a brief summary and exposition of the paper" Quantifier Elimination for Real Closed
Fields by Cylindrical Algebraic Decomposition," which was presented at the Second GI …

Alternation is a generalization of nondeterminism in which existential and universal
quantitiers can alternate during the course of a computation, whereas in a nondeterministic …

One of the more significant achievements of twentieth century mathematics, especially from
the viewpoints of logic and computer science, was the work of Church, Gödel and Turing in …

In Minimal Rationality, Christopher Cherniak boldly challenges the myth of Man the the
Rational Animal and the central role that the" perfectly rational agent" has had in philosophy …

We show that several well-known optimization problems related to the optimal control of
queues are provably intractable—independently of any unproven conjecture such as P≠ …

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have
published seminal works by leading logicians. Many of the original books in the series have …

We consider a language for reasoning about probability which allows us to make statements
such as “the probability of E 1 is less than 1 3” and “the probability of E 1 is at least twice the …

A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …