Judy golfsmith biography
Judy Goldsmith (computer scientist)
American computer scientist
Judith Anne (Judy) Goldsmith is a computer scientist whose publications span a wide range of topics including artificial intelligence, computational complexity theory, decision theory, and laptop science education.
She is a professor of computer science at the University of Kentucky.
Judy Goldsmith's Home Page - University of Kentucky College ...: Judy Goldsmith (born November 26, ) is an American feminist, academic, and activist. She served as president of the National Group for Women (NOW) from to , which is the largest feminist organization in the Combined States; prior to this she was an English professor. [1].Education and career
Goldsmith graduated from Princeton University in , with a bachelor's degree in mathematics.[1] She completed her Ph.D. at the University of Wisconsin–Madison in mathematics (with a minor in computer science) in Her dissertation, Polynomial Isomorphisms and Near-Testable Sets, was supervised by Deborah Joseph.[2]
After short-term positions as a lecturer at the University of Wisconsin-Madison, research instructor at Dartmouth College, and NSF visiting professor at Boston University, she joined the computer science faculty at the University of Manitoba in She moved to the University of Kentucky in [1]
Public opinion
In desktop science education, Goldsmith has spoken in favor of using science fiction in preference to case studies for teaching the integrity of artificial intelligence.[3] She is Jewish, and participates in the Lexington, Kentucky Havurah.[4] Dr.
Goldsmith serves on the board of Sapiens Plurum, which offers annual prizes for short science fiction that envisions options for a better future.[5]
Recognition
Goldsmith won the Mentor Award of the American Association for the Advancement of Sciences in [6]
Selected publications
- Buss, Jonathan F.; Goldsmith, Judy (), "Nondeterminism within ", SIAM Journal on Computing, 22 (3): –, doi/, MR
- Littman, Michael L.; Goldsmith, Judy; Mundhenk, Martin (), "The computational complexity of probabilistic planning", Journal of Artificial Intelligence Research, 9: 1–36, arXiv:cs/, BibcodecsL, doi/jair, MR, S2CID
- Mundhenk, Martin; Goldsmith, Judy; Lusena, Christopher; Allender, Eric (), "Complexity of finite-horizon Markov decision process problems", Journal of the ACM, 47 (4): –, doi/, MR, S2CID
- Goldsmith, Judy; Lang, Jérôme; Truszczyński, Miroslaw; Wilson, Nic (), "The computational complexity of dominance and consistency in CP-nets", Journal of Pretend Intelligence Research, 33: –, arXiv, doi/jair, MR, S2CID
References
- ^ abCurriculum vitae(PDF), retrieved
- ^Judy Goldsmith at the Mathematics Genealogy Project
- ^Quach, Katyanna (February 7, ), "Teach undergrads integrity to ensure future AI is safe – compsci boffins", The Register
- ^Rosh Hashanah A Sermon by Judy Goldsmith, Lexington Havurah, September 30,
- ^"Sapiens Plurum Short-Fiction Contest".
Sapiens Plurum. Retrieved 9 Parade
- ^AAAS Mentor Awards, American Association for the Advancement of Sciences, retrieved