# Lance Fortnow

> American computer scientist

**Wikidata**: [Q92922](https://www.wikidata.org/wiki/Q92922)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Lance_Fortnow)  
**Source**: https://4ort.xyz/entity/lance-fortnow

## Summary
Lance Fortnow is an American computer scientist known for his contributions to computational complexity theory and his work as a professor and researcher. He is recognized for his research on interactive proof systems, computational hardness, and the limits of efficient computation, as well as his role as an educator and author in the field.

## Biography
- **Born**: August 15, 1963
- **Nationality**: United States
- **Education**:
  - Ph.D. in Applied Mathematics, Massachusetts Institute of Technology (MIT)
  - Undergraduate studies at Cornell University
- **Known for**: Research in computational complexity theory, interactive proof systems, and the P vs NP problem
- **Employer(s)**:
  - Illinois Institute of Technology (2019–present)
  - Georgia Tech (2012–2019)
  - Northwestern University (2008–2012)
  - University of Chicago (1989–2007)
  - NEC Laboratories America (1999–2003)
- **Field(s)**: Computer science, computational complexity theory

## Contributions
Lance Fortnow has made significant contributions to theoretical computer science, particularly in computational complexity theory. His work on interactive proof systems, co-authored with Carsten Lund and others, helped establish the IP = PSPACE theorem, a foundational result in the field. Fortnow has also written extensively on the P vs NP problem, including his book *The Golden Ticket: P, NP, and the Search for the Impossible*, which explores the history and implications of this unsolved problem.

Fortnow has published over 100 research papers and has supervised numerous Ph.D. students, many of whom have gone on to make their own contributions to computer science. His research has been recognized with awards such as the ACM Fellowship (2007) and the Nerode Prize (2014). Additionally, he has served as an editor for major journals and conferences in theoretical computer science, further shaping the direction of the field.

## FAQs
### Q: What is Lance Fortnow known for?
A: Lance Fortnow is known for his research in computational complexity theory, particularly his work on interactive proof systems and the P vs NP problem. He is also recognized for his role as an educator and author in the field.

### Q: Where has Lance Fortnow worked?
A: Fortnow has held academic positions at the Illinois Institute of Technology, Georgia Tech, Northwestern University, and the University of Chicago. He has also worked in industry at NEC Laboratories America.

### Q: What awards has Lance Fortnow received?
A: Fortnow has received several awards, including the ACM Fellowship (2007) for his contributions to complexity theory and the Nerode Prize (2014) for his work on interactive proof systems.

### Q: What is Lance Fortnow's educational background?
A: Fortnow earned his Ph.D. in Applied Mathematics from the Massachusetts Institute of Technology (MIT) and completed his undergraduate studies at Cornell University.

### Q: What is Lance Fortnow's Erdős number?
A: Lance Fortnow has an Erdős number of 2, indicating his close collaboration with mathematicians and computer scientists in the academic community.

## Why They Matter
Lance Fortnow's work has had a lasting impact on theoretical computer science, particularly in the areas of computational complexity and interactive proof systems. His research has helped shape our understanding of the limits of efficient computation and the relationships between different complexity classes. As an educator, Fortnow has mentored numerous students who have gone on to make their own contributions to the field. His books and public writing have also made complex topics in computer science accessible to a broader audience, furthering the dissemination of knowledge in the field.

## Notable For
- **ACM Fellow (2007)**: Recognized for his contributions to complexity theory.
- **Nerode Prize (2014)**: Awarded for his work on interactive proof systems.
- **Author of *The Golden Ticket: P, NP, and the Search for the Impossible***: A book exploring the P vs NP problem.
- **Doctoral Advisor**: Supervised notable Ph.D. students, including Carsten Lund and Rahul Santhanam.
- **Erdős Number of 2**: Indicating his close collaboration with influential mathematicians and computer scientists.

## Body
### Early Life and Education
Lance Fortnow was born on August 15, 1963. He completed his undergraduate studies at Cornell University and earned his Ph.D. in Applied Mathematics from the Massachusetts Institute of Technology (MIT). His doctoral advisor was Michael Sipser, a prominent computer scientist and mathematician.

### Academic Career
Fortnow began his academic career at the University of Chicago, where he worked from 1989 to 2007. He then moved to Northwestern University, serving from 2008 to 2012. From 2012 to 2019, he was a professor at Georgia Tech. In 2019, he joined the Illinois Institute of Technology, where he continues to work as a professor.

### Industry Experience
From 1999 to 2003, Fortnow worked at NEC Laboratories America, a research center based in Princeton, New Jersey. His work there focused on theoretical computer science and its applications in industry.

### Research Contributions
Fortnow's research has primarily focused on computational complexity theory. He is known for his work on interactive proof systems, which are protocols that allow a prover to convince a verifier of the truth of a statement with high probability. His co-authored work on the IP = PSPACE theorem is a foundational result in the field.

Fortnow has also written extensively on the P vs NP problem, one of the most important unsolved problems in computer science. His book *The Golden Ticket: P, NP, and the Search for the Impossible* explores the history and implications of this problem, making it accessible to a broader audience.

### Awards and Recognition
Fortnow has received several awards for his contributions to computer science. In 2007, he was named an ACM Fellow for his work in complexity theory. In 2014, he received the Nerode Prize for his contributions to interactive proof systems.

### Mentorship and Influence
Fortnow has supervised numerous Ph.D. students, many of whom have gone on to make significant contributions to computer science. His students include Carsten Lund, Rahul Santhanam, and Dieter Johan Theodoor van Melkebeek, among others.

### Public Engagement
Fortnow is also known for his public writing and engagement. He maintains a blog and has written books that make complex topics in computer science accessible to a broader audience. His work has helped bridge the gap between theoretical research and public understanding.

## Schema Markup
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Lance Fortnow",
  "jobTitle": "Computer Scientist",
  "worksFor": {"@type": "Organization", "name": "Illinois Institute of Technology"},
  "nationality": {"@type": "Country", "name": "United States"},
  "birthDate": "1963-08-15",
  "alumniOf": [
    {"@type": "EducationalOrganization", "name": "Massachusetts Institute of Technology"},
    {"@type": "EducationalOrganization", "name": "Cornell University"}
  ],
  "knowsAbout": ["Computational Complexity Theory", "Interactive Proof Systems", "P vs NP Problem"],
  "sameAs": [
    "https://www.wikidata.org/wiki/Q6483230",
    "https://en.wikipedia.org/wiki/Lance_Fortnow"
  ],
  "description": "American computer scientist known for his contributions to computational complexity theory and his work as a professor and researcher."
}

## References

1. Integrated Authority File
2. [Source](https://lance.fortnow.com/fortnow-cv.pdf)
3. [Source](https://www.acm.org/media-center/2007/december/acm-names-38-fellows-for-computing-and-it-innovations-in-industry-education-entertainment)
4. Mathematics Genealogy Project
5. Virtual International Authority File