John Tromp
John Tromp is a Dutch computer scientist.[1] He formerly worked for the Dutch Centre for Mathematics and Computer Science.[2] Tromp discovered the number of legal states of the board game Go,[1][2] and co-authored with Bill Taylor the Tromp–Taylor rules,[3][4] which they call "the logical rules of Go".[5]
He is also known for his work in binary combinatory logic (binary lambda calculus)[citation needed] and lambda diagrams that supply a graphical way of representing lambda calculus expressions.[6][7] Tromp has done research on a lambda calculus-equivalent to the busy beaver function.[8]
References
[edit]- 1 2 Shotwell, Peter (2016). "John Tromp and the Big Numbers of Go: The Possible Positions, Games and the Longest" (PDF). American Go Association. Archived from the original (PDF) on 6 March 2019.
- 1 2 Johnson, Leif (25 January 2016). "After 2,500 Years, a Chinese Gaming Mystery is Solved". Vice.com. Retrieved 30 December 2017.
- ↑ "1995 edition of Tromp-Taylor Rules". 13 February 1995. Retrieved 30 December 2017.
- ↑ "1996 edition of Tromp-Taylor Rules". Retrieved 30 December 2017.
- ↑ "The Rules of Go". American Go Association. Retrieved 30 December 2017.
- ↑ John Tromp Lambda Diagrams.
- ↑ YouTube 2025.
- ↑ Tromp, John (2026-04-26). "The Largest Number Representable in 64 Bits". Entropy. 28 (5): 494. doi:10.3390/e28050494. ISSN 1099-4300. PMC 13205354. PMID 42187911.
External links
[edit]- John Tromp's homepage at GitHub
- John Tromp's entry on the Chess Programming Wiki
- "Lambda Diagrams". Lambda Diagrams. Retrieved 2025-03-24.
- "What is PLUS times PLUS?". YouTube. 2025-03-06. Retrieved 2025-03-24.
- "Tromp Interview (The Big Numbers of Go)". YouTube. Numberphile. 2024-03-06.
| International | |
|---|---|
| National | |
| Academics | |
   | This article about a Dutch scientist is a stub. You can help Wikipedia by adding missing information. |
