Profile Activity

zython

Meta user

Network profile

Reputation

222

Top tag

computability

Next privilege

250 Rep.

View close votes

Badges

Newest

Caucus

Next badge

0/1

Impact

0 posts edited

6 helpful flags

38 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

14 Questions

Views Newest Activity Votes

votes

answer

276

views

Proving special case of SAT is in P

Jan 21 at 20:38 Community♦ 1

votes

answer

views

Exponential Space Complexity equality

complexity-theory space-complexity

Aug 28 '18 at 20:36 Yuval Filmus 210k

votes

answers

468

views

PCP undecidability

reductions undecidability

Aug 7 '18 at 21:40 Yuval Filmus 210k

votes

answer

views

Build all valid parenthesis in polynomial time

time-complexity dynamic-programming

Jun 7 '18 at 0:08 D.W.♦ 107k

votes

answer

views

How to reduce language is finite to language is regular?

formal-languages reductions decision-problem

Feb 26 '18 at 11:36 ttnick 893

vote

answer

320

views

Reducing the infinite language problem to halting problem

computability reductions undecidability halting-problem

Feb 25 '18 at 14:08 Yuval Filmus 210k

vote

answers

111

views

What is a “Master-Reduction”?

complexity-theory np-complete reductions

Feb 28 '18 at 9:56 Yuval Filmus 210k

votes

answers

views

How do I develop a structured work method for theoretical computer science? [closed]

complexity-theory formal-languages computability

Dec 15 '17 at 22:11 zython 222

votes

answer

136

views

What does $|w|$ mean in the statement “ $|w|$ where $w \in L \subset \Sigma^*$”?

formal-languages notation

Apr 10 '18 at 18:23 padawan 747

vote

answer

109

views

Maximum value of LOOP-Program turing-computable

computability loops check-my-answer

Dec 19 '17 at 14:28 zython 222

vote

answer

views

Construct a computable function from non-computable funciton

computability

Nov 4 '17 at 18:24 Ariel 10.8k

vote

answer

209

views

Show that function is not turing-computable?

computability check-my-answer

Nov 6 '17 at 5:06 Stella Biderman 667

votes

answers

135

views

Do Combinational Logic circuits describe a set of languages?

formal-languages automata chomsky-hierarchy

Aug 2 '17 at 17:24 zython 222

votes

answer

334

views

single tape NTM to single tape DTM equivalence

turing-machines time-complexity nondeterminism

Jun 18 '17 at 14:27 Yuval Filmus 210k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

14 Questions

Proving special case of SAT is in P

Exponential Space Complexity equality

PCP undecidability

Build all valid parenthesis in polynomial time

How to reduce language is finite to language is regular?

Reducing the infinite language problem to halting problem

What is a “Master-Reduction”?

How do I develop a structured work method for theoretical computer science? [closed]

What does $|w|$ mean in the statement “ $|w|$ where $w \in L \subset \Sigma^*$”?

Maximum value of LOOP-Program turing-computable

Construct a computable function from non-computable funciton

Show that function is not turing-computable?

Do Combinational Logic circuits describe a set of languages?

single tape NTM to single tape DTM equivalence