Age, Biography and Wiki
William Gasarch was born on 1959 in United States, is an American computer scientist. Discover William Gasarch's Biography, Age, Height, Physical Stats, Dating/Affairs, Family and career updates. Learn How rich is he in this year and how he spends money? Also learn how he earned most of networth at the age of 65 years old?
We recommend you to check the complete list of Famous People born on .
He is a member of famous computer with the age 65 years old group.
William Gasarch Height, Weight & Measurements
At 65 years old, William Gasarch height not available right now. We will update William Gasarch's Height, weight, Body Measurements, Eye Color, Hair Color, Shoe & Dress size soon as possible.
| Physical Status |
| Height |
Not Available |
| Weight |
Not Available |
| Body Measurements |
Not Available |
| Eye Color |
Not Available |
| Hair Color |
Not Available |
Dating & Relationship status
He is currently single. He is not dating anyone. We don't have much information about He's past relationship and any previous engaged. According to our Database, He has no children.
| Family |
| Parents |
Not Available |
| Wife |
Not Available |
| Sibling |
Not Available |
| Children |
Not Available |
William Gasarch Net Worth
His net worth has been growing significantly in 2023-2024. So, how much is William Gasarch worth at the age of 65 years old? William Gasarch’s income source is mostly from being a successful computer. He is from United States. We have estimated William Gasarch's net worth, money, salary, income, and assets.
| Net Worth in 2024 |
$1 Million - $5 Million |
| Salary in 2024 |
Under Review |
| Net Worth in 2023 |
Pending |
| Salary in 2023 |
Under Review |
| House |
Not Available |
| Cars |
Not Available |
| Source of Income |
computer |
William Gasarch Social Network
Timeline
William Ian Gasarch (born 1959 ) is an American computer scientist known for his work in computational complexity theory, computability theory, computational learning theory, and Ramsey theory.
He is currently a professor at the University of Maryland Department of Computer Science with an affiliate appointment in Mathematics.
Gasarch received his doctorate in computer science from Harvard in 1985, advised by Harry R. Lewis.
His thesis was titled Recursion-Theoretic Techniques in Complexity Theory and Combinatorics.
He was hired into a tenure track professorial job at the University of Maryland in the Fall of 1985.
He was promoted to Associate Professor with Tenure in 1991, and to Full Professor in 1998.
Gasarch co-founded (with Richard Beigel) the field of Bounded Queries in Recursion Theory and has written many papers in the area capped off by a book on the topic co-authored with Georgia Martin, titled Bounded Queries in Recursion Theory.
He has published books such as Problems with a Point, a book with a broad view on mathematics and theoretical computer science which he co-authored with Clyde Kruskal and includes works by other professors such as David Eppstein.
He also co-founded the subfield of recursion-theoretic inductive inference named Learning via Queries with Carl Smith.
More recently he has been more involved with combinatorics, notably Ramsey Theory.
Gasarch is a frequent mentor of high school student research projects; one of these, with Jacob Lurie, won the 1996 Westinghouse Science Talent Search for Lurie.
He was book review editor for ACM SIGACT NEWS from 1997 to 2015.
He has written three surveys of what theorists think of the P vs NP problem: in 2002, 2012, and 2019.
Lance Fortnow began writing a blog on theoretical computer science with an emphasis on complexity theory in 2002.
He has co-blogged on computational complexity with Lance Fortnow since 2007.
Gasarch was a frequent guest blogger until 2007 when he became an official co-blogger.
In 2020 he wrote Mathematical Muffin Morsels: Nobody Wants a Small Piece with Erik Metz, Jacob Prinz, and Daniel Smolyak.
