Anıl Ada

Assoc. Teaching Prof. of Computer Science @CSDatCMU, @SCSatCMU, @CarnegieMellon

[Anıl Ada @Anil_Ada_]

We can elegantly prove Gödel's 1st and 2nd incompleteness theorems using the language of computation. In this blog post, I present it in a way so that things follow intuitively from Cantor's work. And the concept of self-referencing emerges from a more basic principle. Link below

[Anıl Ada @Anil_Ada_]

On the one hand, 3SAT has a surprising and very clever subexponential-time algorithm.

On the other hand, no polynomial-time approximation algorithm for MAX-3SAT can do better than flipping a coin for each variable (unless P = NP).

[Anıl Ada @Anil_Ada_]

@WesPegden I guess there is a spectrum here, and hopefully we'll find a good balance.

[Anıl Ada @Anil_Ada_]

In math, is there still a point in communicating a full proof among ourselves, or should we just communicate the proof idea? (Assuming a machine can fill in the details.)

[Anıl Ada @Anil_Ada_]

@JavierBurroni Interesting. Didn't know that. Thanks!

[Anıl Ada @Anil_Ada_]

This is a small clip from one of my lectures. But I don't actually speak Spanish. How good is this?

[Anıl Ada @Anil_Ada_]

For comparison, here is the original.

[Anıl Ada @Anil_Ada_]

@b_subercaseaux That's good to know. Thanks!

[Anıl Ada @Anil_Ada_]

I talked to Anupam Gupta @anupamg about his research area, theoretical computer science in general, advice for students, and more... He is one of the kindest and smartest people you'll ever meet.

https://t.co/ICi4M7XZGC

[Anıl Ada @Anil_Ada_]

https://t.co/GllTFjcZbc

[Anıl Ada @Anil_Ada_]

We can elegantly prove Gödel's 1st and 2nd incompleteness theorems using the language of computation. In this blog post, I present it in a way so that things follow intuitively from Cantor's work. And the concept of self-referencing emerges from a more basic principle. Link below

[Anıl Ada @Anil_Ada_]

Here is the code: https://t.co/9yAidWaL53

[Anıl Ada @Anil_Ada_]

17/91, 78/85, 19/51, 23/38, 29/33, 77/29, 95/23,
77/19, 1/17, 11/13, 13/11, 15/14, 15/2, 55/1.

These fractions encode all the prime numbers!

https://t.co/jFJiNhGucj

[Anıl Ada @Anil_Ada_]

AI generated art.
Prompt: Great Ideas in Theoretical Computer Science.

[Ryan O'Donnell @BooleanAnalysis]

An inspiring talk (at a personal and a scientific level) by the great Bernhard Haeupler at CMU; do watch at least the first 5 minutes!

https://t.co/FFJ776zKty

[Ryan O'Donnell @BooleanAnalysis]

🎉¡¡¡¡¡Anil Ada is putting his lectures for CS 251 (Great Ideas in Theoretical Computer Science) online!!!!!

I can GUARANTEE you will never find awesomer explanations of the fundamentals of CS Theory. These lectures are PURE GOLD, seriously!!

https://t.co/r1otWprSJB

[Anıl Ada @Anil_Ada_]

@BooleanAnalysis Thank you!

If you see an awesome explanation in these videos, it is probably because I stole it from @BooleanAnalysis

[Anıl Ada @Anil_Ada_]

Very excited about this!

[Pravesh K. Kothari @praveshkkothari]

Algorithms model any process evolving via simple, local steps. So insights from theory of computation are relevant far beyond CS. With that as motto & inspired by Avi W's "math & computation", @Anil_Ada_ & I'll teach "The Computational Lens" in Spring'22 https://t.co/z3kmaTEjdI

[Anıl Ada @Anil_Ada_]

@RichardDawkins That being said, there is really no alternative to evaluating and trying to understand nature using logic. And in this sense, it will always be mathematical.

[Anıl Ada @Anil_Ada_]

@RichardDawkins I think what people really mean is that elegant/simple math theories are surprisingly powerful at modeling the universe.

As an analogy, you might say the source code of the universe is short and elegant as opposed to being an endless sequence of conditionals.

[Ryan O'Donnell @BooleanAnalysis]

Had a great time being on @Anil_Ada_'s (new?) podcast. He asked me mostly about quantum computing...

https://t.co/o2VvRiu6U2

Eagerly awaiting to see who he interviews next... :-)