k2forever

Unregistered

Member for 14 years, 4 months

Network profile

Summary

Reputation

381

381
356
331

2021
2022
2023
2024

Top tag

computational-complexity

Next privilege

500 Rep.

Access review queues

Badges

3

4

Newest

Good Question

Next badge

0/1

Supporter

Impact

~9k

people reached

0

posts edited

0

helpful flags

0

votes cast

Questions

30

Why is proving P != NP so hard?

Jul 26, 2010

8

Wolfram's 2-state 3-symbol Turing machine

Jul 26, 2010

Answers

This user has not answered any questions

Tags

computational-complexity

0

Score

1

post

automata-theory

0

Score

1

post

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

This user doesn’t have any gold badges yet.

3

silver badges

Good Question

Nov 5, 2016
Notable Question

Oct 4, 2014
Yearling

Jul 27, 2011

4

bronze badges

Nice Question

Jul 26, 2010
Popular Question

× 2

Nov 16, 2015
Student

Jul 26, 2010

Accounts

381
3
4

Active bounties (0)

This user has no active bounties

Votes cast

This user has not cast any votes