UT CS Professor Dr. Dana Moshkovitz in room 505 at lunch TODAY !!!!

In 1936 Alan Turing proved that there exist algorithmic problems that do not have algorithms. This is one of the most important theorems about the limitations of algorithms. In the talk I'll discuss what it means and prove it. Along the way, I'll talk about paradoxes and puzzles.

Regular Expressions are super useful!!!
Learn here    practice here or here   see if you can get a high score here
 email Mr. Mueller a pic of your high score   high1

Peer Tutoring

To request a tutor please fill out the below form. When you submit the form, your selected tutor will receive an email with your contact info.  The tutor will contact you and arrange for a time to get together. Please let Mr. Mueller know if you don’t hear back from a tutor (as that likely means the automated email program is not working properly).

Tutors for 2025-26
Pieter_sm matt_sm fred_xm Adya
 Pieter AP,Adv  Matt  Fun,AP,Adv,Digi  Fred Digi Adya  Fun, AP
 Holland Charlie_sm  HugoSm  Shaoyu
Holland Digi Charlie AP,Adv,Web,Digi Hugo Fun Shaoyu  AP CS
 ashwin_sm  Jonah_sm  seth Prahalad
Ashwin Fun,AP,Adv,Digi Jonah Fun Seth Fun, APCS Prahalad APCS,Digi