Network profile

Asaf

Reputation

61

61

Apr
Jul
Oct
Jan

Top tag

turing-machines

Next privilege

75 Rep.

Set bounties

Badges

4

Newest

Supporter

Next badge

9/10

Impact

0 posts edited

0 helpful flags

1 vote cast

6 Questions

Votes Activity Newest Views

2

votes

1

answer

94

views

If $L=\big\{\langle M_1,M_2\rangle\mid M_1, M_2\text{ are TM and } L(M_1)\cup L(M_1)=\Sigma^* \big\}$ is in $RE$ or $coRE$ or not in $RE\cup coRE$?

turing-machines reductions

Aug 3 '18 at 13:29 Daniel Mroz 376

1

vote

1

answer

45

views

How to start solving this type of exercise: Determine if $L$ is in $RE\setminus coRE$ or $coRE\setminus RE$ or $R$ or not in $RE\cup coRE$?

turing-machines reductions undecidability

Jul 31 '18 at 13:48 Yuval Filmus 241k

1

vote

1

answer

133

views

Prove or disprove if $L_{1}$ is Turing-recognizable and $L_{2}$ is co-Turing-recognizable then $L_{1}\cap L_{2}$ is decidable

turing-machines computability

Jul 27 '18 at 10:02 xskxzr 6,539

1

0

votes

3

answers

699

views

Prove or disprove if $L_{1}$ is undecidable and $L_{2}$ is finite language then $L_{1} \cup L_{2}$ is undecidable

turing-machines undecidability halting-problem

Feb 13 '20 at 22:40 vonbrand 12.5k

0

votes

1

answer

55

views

Determine in which class $L=\big\{\langle M_1,M_2,w\rangle\mid M_1,M_2\text{ are TM and }L(M_1)\cap L(M_2)=\{w\}\big\}$ [closed]

turing-machines

Aug 15 '19 at 3:04 Community♦ 1

1

-1

votes

1

answer

279

views

Cache (TLB) - fully associative cache

computer-architecture cpu-cache

Oct 8 '17 at 18:10 Raphael♦ 69k

Computer Science Stack Exchange works best with JavaScript enabled