Announcer - Badge - Theoretical Computer Science Stack Exchange

Announcer

Share a link to a post later visited by 25 unique IP addresses. This badge can be awarded multiple times.

Gro-Tsen

6193 silver badges15 bronze badges

earned this badge 7 times.

What can we do with a generic oracle (as opposed to a random one)?

Awarded Nov 28 at 12:10

Technical limitations of Turing machines due to the input and output encoding of values

Awarded Nov 18 at 14:36

Connection between strong normalization of the simply typed λ-calculus, and cut elimination for propositional logic

Awarded Nov 17 at 9:55

Is there a text that discusses both the “lambda cube” of pure type theories and Martin-Löf's intuitionistic type theories, and compares them?

Awarded Nov 10 at 15:47

Is P=NP relative to the halting oracle?

Awarded Sep 8 at 23:36

Complexity relative to the graph of the Busy-Beaver function

Awarded Jun 25, 2020 at 22:20

Has there been any development of complexity theory for other Turing degrees than 0?

Awarded Jun 23, 2020 at 10:12

Others with this badge