2024-12-20 22:01:05
Revision.
.
.
.
.
.
.
.
#friday #FridayFeeling #programmerslife #programmerhumor #programmerjokes #programmermemes #programmers #programmer #codingmemes #programmingforkids #programmingmemes #ACM #codingisfun #coding #codinglife #fridayvibes #programminglife #programmingjokes #fridaymood #programmingisfun #codingpics #programminghumor #programming #computing #programmerlife
2024-12-19 23:44:21
Sean Chandler, President of Aaniiih Nakoda College, on the significance of protecting sacred images. Check out the rest of the panel via #linkinbio⠀
2024-12-19 00:08:09
Photos of #HourofCode events are pouring in, and we love them! Proud of your chapter's event? Tag us in your post and send your photos to [email protected] to be featured here!
Photo credit: University of Belize ACM Student Chapter
2024-12-17 21:02:09
On this day in 1920, Kenneth Iverson, recipient of the #ACMTuringAward , was born. He received the award in 1979 for his pioneering effort in programming languages and mathematical notation resulting in what the computing field now knows as APL, for his contributions to the implementation of interactive systems, to educational uses of APL, and to programming language theory and practice.
2024-12-16 21:09:25
Ian Her Many Horses, Co-founder of IndigiGenius, sharing his experience introducing CS to his home community. Check out the rest of the panel via #linkinbio⠀
2024-12-14 20:55:20
Happy birthday, Stephen Cook! Cook received the #ACMTuringAward in 1982 for his advancement of our understanding of the complexity of computation in a significant and profound way.
His seminal paper, "The Complexity of Theorem Proving Procedures," presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness. The ensuing exploration of the boundaries and nature of NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade.
Here, Cook discusses his first exposure to complexity theory and his thesis work on the complexity of multiplication.
