Sam Buss

from Wikipedia, the free encyclopedia

Samuel R. "Sam" Buss (born August 6, 1957 ) is an American computer scientist and mathematical logician.

Buss studied at Emory University with a bachelor's degree in 1979 and at Princeton University , where he received his master's degree in 1983 and received his doctorate in 1985 with Simon Cooking ( bounded arithmetic ). From 1986 he was a lecturer at the University of California, Berkeley . From 1988 he was Assistant Professor and from 1993 Professor at the University of California, San Diego .

Buss deals with mathematical logic, evidence complexity, and complexity theory .

He is considered to be one of the fathers of bounded arithmetic, i.e. weakened versions of Peano arithmetic in which, for example, the quantifiers are limited. It was introduced in 1971 by Rohit Jivanlal Parikh . Buss dealt with it in 1985 as part of his dissertation, which was also published as a book and is a standard work in this field.

In 1987 he proved that the Boolean evaluation problem is ALOGTIME (alternating log time).

For 2019 he received the Gödel Prize .

Fonts (selection)

  • Bounded Arithmetic, Naples: Bibliopolis, 1986, online

Web links

Individual evidence

  1. ↑ Sam Buss in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ↑ Buss, The Boolean formula value problem is in ALOGTIME, in: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC'87), 1987, pp. 123-131. Online on his homepage
personal data
SURNAME Buss, Sam
ALTERNATIVE NAMES Buss, Samuel R.
BRIEF DESCRIPTION American computer scientist and mathematical logician
DATE OF BIRTH August 6, 1957