Theoretical Computer Science
Network profile
53
reputation
6

Nift

Curious about metamathematics and computation

0
answers
3
questions
~272
people reached
  • Somewhere
  • Member for 1 year, 6 months
  • 4 profile views
  • Last seen 6 hours ago

Communities (6)

Top network posts

We respect a laser-like focus on one topic.

Top tags (7)

Score 0
Posts 1
Posts % 33
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
View all tags →

Top posts (3) All Questions Answers | Votes Newest

3 Does a non-constructive proof of bounds of a computable asymptotic complexity, with impossible fix, exist? Sep 28 '18
1 Extended Church's thesis and internal parametricity Dec 3 '19
0 Incompleteness and term extraction Oct 9 '19

Badges (6)

Gold

—

Silver

—

Bronze

6

Rarest