BEGIN:VCALENDAR
VERSION:2.0
PRODID:ics.py - http://git.io/lLljaA
BEGIN:VEVENT
DESCRIPTION:Come see CS Professor Ben Nye discuss what is computable and what - if anything - may never be solved by algorithms! Though currently a visiting professor\, he is applying to join the tenure-track faculty\; student attendees are encouraged to give feedback using a form that will be provided at the talk.\n\nRated PG (some programming experience recommended).\nFriday • 12/9/22 • 12:30 - 1:30 PM\nKresge Lecture Hall (Tutt 122)\n\nFull abstract:\nEvery year computer science tools and algorithms pop up in new places: they pick which students get into which classes\, how packages get routed\, what advertisements you see\, how AI plays games\; the list goes on and on and on. Will advances in algorithmic problem-solving march relentlessly forward until humans are free from making any decisions at all\, or are there limits on what is computable? In this talk we will discuss what it means for something to be computable\, how we can determine what is "easy" and "hard"\, and ultimately quantify how many of the problems out there are within reach of algorithmic solutions.\n\nhttps://today.coloradocollege.edu/events/5747
DTEND:20221209T203000Z
LOCATION:Tutt Science 122 - Lecture Hall (Social Science)
DTSTART:20221209T193000Z
SUMMARY:Talk: Is Computer Science Unstoppable?
UID:69efc7eb-8e17-49bf-871f-afbbcb3b7743
END:VEVENT
END:VCALENDAR