| 词条 | Samuel Buss |
| 释义 |
| name = Samuel R. Buss | image = | image_size = 150px | caption = | birth_date = | birth_place = | death_date = | death_place = | residence = | citizenship = | nationality = | ethnicity = | field = Computer Science, Mathematics | work_institution = University of California, Berkeley, University of California, San Diego | alma_mater = Princeton University Emory University | doctoral_advisor = Simon Kochen | doctoral_students = | known_for = Bounded arithmetic Boolean formula evaluation | author_abbreviation_bot = | author_abbreviation_zoo = | prizes = | religion = | footnotes = }} Samuel R. (Sam) Buss is an American computer scientist and mathematician who has made major contributions to the fields of mathematical logic, complexity theory and proof complexity. He is currently a Professor at the University of California, San Diego, Department of Computer Science and Department of Mathematics. BiographyBuss received his bachelor's degree in 1979 from the Emory University, and his master's degree and Ph.D. from Princeton University, respectively in 1983 and 1985. He joined the University of California, Berkeley, mathematics department in 1986 as an Lecturer, and stayed there until 1988. Buss joined the faculty of University of California, San Diego, Computer Science and Mathematics Departments in 1988 as an Assistant Professor, where he was promoted to Professor in 1993. ResearchBuss is considered one of the forefathers of bounded arithmetic and proof complexity.[1] During his PhD, Buss worked in bounded arithmetic. He received his PhD in 1985. He introduced bounded arithmetic in his thesis and gave a nice proof theoretic characterization of polynomial time computation. His thesis is one of the main references in the area of bounded arithmetic.{{citation needed|date=August 2011}} His is also author/editor of several books in mathematical logic and computer science.[2] Buss proved in 1983 that the Boolean Formula Evaluation problem is in ALogTime, a major result in complexity theory. His main research areas are mathematical logic, complexity theory and proof complexity. Other areas which he has contributed to include bounded arithmetic, bounded reverse mathematics, and lower bounds in propositional proof systems. References1. ^{{cite web|url=https://rjlipton.wordpress.com/2010/01/17/a-limit-of-first-order-logic/ |title=A Limit of First Order Logic « Gödel’s Lost Letter and P=NP |publisher=Rjlipton.wordpress.com |date= |accessdate=2012-07-09}} 2. ^http://math.ucsd.edu/~sbuss/ResearchWeb/index.html External links
6 : Living people|American computer scientists|Emory University alumni|Princeton University alumni|University of California, San Diego faculty|Year of birth missing (living people) |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。