Profile Activity

ttnick

Network Profile

Reputation

773

773
583
393

Jul
Oct
Jan
Apr

Top tag

formal-languages

Next privilege

1,000 Rep.

See votes, expandable usercard

Badges

2

11

Newest

Yearling

Next badge

0/1

Impact

4 posts edited

9 helpful flags

100 votes cast

summary answers questions tags badges favorites bounties reputation all actions

Answers (27)

votes activity newest

3	Fantasy premier league dream team algorithm?
3	Assumption: A PSPACE-hard problem can be solved in polynomial time
3	Do the classes $P$ and $NP$ include problems faster then polynomial?
3	Are the implications of the diagonalization language different from those of the halting problem?
3	Where is the second face in a graph with 3 nodes?

View more →

Reputation (773)

This user has no recent positive reputation changes

View more →

Questions (0)

votes activity newest

This user has not asked any questions

Tags (40)

9 formal-languages × 7	6 complexity-theory × 2
6 turing-machines × 8	5 context-free × 5
6 computability × 4	4 automata × 3
6 finite-automata × 4	4 undecidability × 3
6 regular-languages × 3	3 regular-expressions × 2

View more →

Accounts (19)

	Computer Science	773 rep	211
	Academia	178 rep	17
	Area 51	151 rep	2
	TeX - LaTeX	115 rep	4
	Stack Overflow	108 rep	17

Badges (13)

recent class name

Yearling	Informed
Constituent	Explainer
Caucus	Critic
Custodian	Supporter
Citizen Patrol	Commentator

View more →

Active bounties (0)

active offered earned

This user has no active bounties

Votes Cast (100)

all time			by type
63	up		51	question
37	down		49	answer

Computer Science Stack Exchange works best with JavaScript enabled