User Anwar Saiah

2 votes

2 answers

2k views

Set of all countably infinite strings over a finite alphabet >1

asked Dec 5, 2017 at 9:00

2 votes

3 answers

246 views

Is this language in P?

asked Jan 15, 2018 at 4:25

2 votes

2 answers

518 views

XOR of two NP-Complete languages

asked Mar 2, 2018 at 9:02

2 votes

1 answer

230 views

Reduce ATM to CFTM

asked Mar 20, 2018 at 16:00

2 votes

1 answer

92 views

M is a Determinstic TM with one tape, c2 is c1 reachable, if it's reachable within finite positive time

asked Aug 24, 2018 at 12:41

1 vote

1 answer

120 views

Is A times B of NP-complete languages A and B necessarily NP-hard?

asked Mar 25, 2018 at 19:56

1 vote

2 answers

3k views

Need a polynomial time reduction from 3SAT to INDEPENDENT-SET

asked Jan 8, 2018 at 13:31

1 vote

1 answer

677 views

Does every language in BPP have a mapping reduction to ATM?

asked Mar 15, 2018 at 8:52

1 vote

2 answers

2k views

Is the class of Turing-recognizable languages closed under Homomorphism?

asked Feb 4, 2018 at 16:43

1 vote

1 answer

1k views

How to show MULT={a#b#c| a,b,c binary natural numbers and a ✕ b = c} is in Log Space?

asked Feb 4, 2018 at 20:29

1 vote

1 answer

832 views

PSpace-completeness under PSpace reductions

asked Jan 25, 2018 at 7:17

0 votes

1 answer

532 views

Perfect natural number

asked Feb 3, 2018 at 15:12

0 votes

2 answers

5k views

How would one reduce HaltTM to ATM

asked Dec 6, 2017 at 16:07

0 votes

1 answer

116 views

Given three languages L1 L2 L3 that do not intirsect could one be TR and the other TD and the third neither

asked Mar 10, 2018 at 10:26

0 votes

0 answers

87 views

Is there a mapping reduction of E(tm) to OVERLAP(tm)?

asked Aug 26, 2018 at 8:21

-1 votes

1 answer

211 views

Given three infinite languages L1 L2 L3 over the same Alphabet, that do not intirsect. could one be TR and the other TD and the third neither?

asked Mar 10, 2018 at 20:19

Stack Exchange Network

16 Questions

Set of all countably infinite strings over a finite alphabet >1

Is this language in P?

XOR of two NP-Complete languages

Reduce ATM to CFTM

M is a Determinstic TM with one tape, c2 is c1 reachable, if it's reachable within finite positive time

Is A times B of NP-complete languages A and B necessarily NP-hard?

Need a polynomial time reduction from 3SAT to INDEPENDENT-SET

Does every language in BPP have a mapping reduction to ATM?

Is the class of Turing-recognizable languages closed under Homomorphism?

How to show MULT={a#b#c| a,b,c binary natural numbers and a ✕ b = c} is in Log Space?

PSpace-completeness under PSpace reductions

Perfect natural number

How would one reduce HaltTM to ATM

Given three languages L1 L2 L3 that do not intirsect could one be TR and the other TD and the third neither

Is there a mapping reduction of E(tm) to OVERLAP(tm)?

Given three infinite languages L1 L2 L3 over the same Alphabet, that do not intirsect. could one be TR and the other TD and the third neither?