Gro-Tsen

Member for 10 years, 2 months
Last seen this week

Twitter
madore.org/~david
Paris, France

Network profile

Summary

Reputation

619

619
360
101

2020
2021
2022
2023

Top tag

computability

Next privilege

1,000 Rep.

See votes

Badges

3

15

Newest

Yearling

Next badge

0/1

Custodian

Questions

View all 8 questions

Score Activity Newest Views

12

Complexity relative to the graph of the Busy-Beaver function

Jun 23, 2020

10

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?

Nov 9

9

Is P=NP relative to the halting oracle?

Sep 8

8

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

Nov 27

5

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

Jun 22, 2020

Answers

Score Activity Newest

This user has not answered any questions

Tags

View all 11 tags

computability

0

Score

5

posts

cc.complexity-theory

0

Score

4

posts

oracles

0

Score

2

posts

lo.logic

0

Score

2

posts

type-theory

0

Score

1

post

Reputation

+40

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

+80

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

+20

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

+10

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?

Badges

View all badges

This user doesn’t have any gold badges yet.

3

silver badges

Yearling

× 3

Nov 30

15

bronze badges

Curious

Nov 10
Announcer

× 7

Nov 28
Commentator

Nov 18

Accounts

View all 29 accounts

28.4k
4
78
314

5,419
22
52

816
5
7

742
5
9

Theoretical Computer Science

619
3
15

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

28

upvotes

11

question votes

17

answer votes