Network profile

Stella Biderman

Reputation

1,016

1k
563
101

2018
2019
2020
2021

Top tag

cc.complexity-theory

Next privilege

2,000 Rep.

Edit questions and answers

Badges

6

19

Newest

Yearling

Next badge

0/1

Impact

6 posts edited

24 helpful flags

104 votes cast

4 Questions

Votes Activity Newest Views

1

11

votes

1

answer

552

views

Non-comparable natural numbers

computability undecidability

May 8 '19 at 16:23 Stella Biderman 1,016

5

votes

0

answers

80

views

Are there languages require many variables to achieve $\Sigma_n^0$ completeness?

lo.logic computability

Sep 17 '19 at 18:35 Stella Biderman 1,016

2

5

votes

0

answers

266

views

Games on Turing machines that are AH-hard

turing-machines gt.game-theory board-games combinatorial-game-theory

Sep 13 '18 at 18:02 Stella Biderman 1,016

3

5

votes

1

answer

298

views

Is there a useful notion of being “approximately computable”

reference-request computability

Aug 29 '18 at 13:22 Stella Biderman 1,016

Theoretical Computer Science Stack Exchange works best with JavaScript enabled