Jump to content

Matt Kaufmann

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by JJMC89 bot III (talk | contribs) at 20:50, 21 September 2020 (Moving Category:Lisp people to Category:Lisp (programming language) people per Wikipedia:Categories for discussion/Speedy). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Matt Kaufmann
Matt Kaufmann (right) with J Strother Moore 2006
NationalityUnited States
OccupationComputer scientist
EmployerUniversity of Texas at Austin
Known forLisp programming language, The Boyer-Moore Theorem Prover
AwardsACM Software System Award

Matt Kaufmann is a Senior Research Scientist in the Department of Computer Sciences at the University of Texas at Austin, United States. He was a recipient of the 2005 ACM Software System Award along with Robert S. Boyer and J Strother Moore, for his work on the Boyer-Moore Theorem Prover.[1]

References

  1. ^ Matt Kaufman: The Boyer-Moore Theorem Prover (2005) Archived 2009-08-27 at the Wayback Machine, Association for Computing Machinery, 2005.

External links


P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

Stub icon

This biographical article relating to a computer specialist in the United States is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Matt_Kaufmann&oldid=979630865"