Profile Activity

ttnick

Network Profile

Reputation

773

773
755
738

Nov
Dec
Jan
Feb

Top tag

formal-languages

Next privilege

1,000 Rep.

See votes, expandable usercard

Badges

1

11

Newest

Constituent

Next badge

0/1

Impact

4 posts edited

9 helpful flags

92 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)

+10	Logical and non logical symbols and predicates
+10	Halting problem of TM which recognize recursive languages is undecidable?
+15	Is the set of context free grammars that generate all words in co-RE?
+10	Prove: if $\delta_D(q0, w) = p$ then $\delta_N(q0, w) = {p}$

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 (14)

	Computer Science	773 rep	111
	TeX - LaTeX	115 rep	4
	Mathematics	106 rep	4
	Stack Overflow	101 rep	15
	Spanish Language	101 rep	1

Badges (12)

recent class name

Constituent	Explainer
Caucus	Critic
Custodian	Supporter
Citizen Patrol	Commentator
Informed	Editor

View more →

Active bounties (0)

active offered earned

This user has no active bounties

Votes Cast (92)

all time			by type			month
56	up		48	question		2
36	down		44	answer		2

Computer Science Stack Exchange works best with JavaScript enabled