Question

If RE languages are closed under intersection, why aren't CFLs?

score 395 · Answer 1 · 2026-05-10 12:53:05

395

Views

If RE languages are closed under intersection, why aren't CFLs?

Published on 10 May 2026 - 12:53

score 277 · Answer 2 · 2026-04-11 11:08:16

277

Views

Is there actually a universal notion of computability?

Published on 11 Apr 2026 - 11:08

score 108 · Answer 3 · 2026-04-09 02:23:31

108

Views

Why is this TM problem decidable

Published on 09 Apr 2026 - 2:23

score 755 · Answer 4 · 2026-05-10 13:19:48

755

Views

Every Turing machine corresponds to a formal system

Published on 10 May 2026 - 13:19

score 61 · Answer 5 · 2026-04-12 22:29:13

61

Views

Is a language whose only ability to affect state comes from calling other languages Turing-complete?

Published on 12 Apr 2026 - 22:29

score 111 · Answer 6 · 2026-04-09 02:21:53

111

Views

Do given Turing Machines M,N accepts equinumerous languages?

Published on 09 Apr 2026 - 2:21

score 122 · Answer 7 · 2026-04-09 02:26:07

122

Views

Does solving the complexity class ALL collapse all Turing degrees?

Published on 09 Apr 2026 - 2:26

score 125 · Answer 8 · 2026-05-10 14:04:53

125

Views

Is there a countable computably saturated model of ZFC that correctly solves the halting problem?

Published on 10 May 2026 - 14:04

score 53 · Answer 9 · 2026-04-12 05:00:00

53

Views

Classes of TMs for which we can solve the halting problem

Published on 12 Apr 2026 - 5:00

score 175 · Answer 10 · 2026-04-11 21:35:36

175

Views

What words does this Turing-machine produce?

Published on 11 Apr 2026 - 21:35

score 824 · Answer 11 · 2026-04-23 01:27:49

824

Views

Can all mathematical operations be encoded with a Turing Complete language?

Published on 23 Apr 2026 - 1:27

score 105 · Answer 12 · 2026-04-17 06:19:57

105

Views

Proving $L=\left\{ \left\langle M\right\rangle \mid L\left(M\right)=A_{TM}\right\} \in\overline{RE\cup coRE}$

Published on 17 Apr 2026 - 6:19

score 115 · Answer 13 · 2026-05-10 13:18:16

115

Views

Dealing with Turing Machines

Published on 10 May 2026 - 13:18

score 47 · Answer 14 · 2026-04-16 16:05:04

47

Views

Non-uniform computation/ computing with advice -- looking for a good introduction

Published on 16 Apr 2026 - 16:05

score 438 · Answer 15 · 2026-04-15 09:31:33

438

Views

Is there any "real" number that may not actually be a real because we haven't found its Dedekind cut?

Published on 15 Apr 2026 - 9:31

List Question

If RE languages are closed under intersection, why aren't CFLs?

Is there actually a universal notion of computability?

Why is this TM problem decidable

Every Turing machine corresponds to a formal system

Is a language whose only ability to affect state comes from calling other languages Turing-complete?

Do given Turing Machines M,N accepts equinumerous languages?

Does solving the complexity class ALL collapse all Turing degrees?

Is there a countable computably saturated model of ZFC that correctly solves the halting problem?

Classes of TMs for which we can solve the halting problem

What words does this Turing-machine produce?

Can all mathematical operations be encoded with a Turing Complete language?

Proving $L=\left\{ \left\langle M\right\rangle \mid L\left(M\right)=A_{TM}\right\} \in\overline{RE\cup coRE}$

Dealing with Turing Machines

Non-uniform computation/ computing with advice -- looking for a good introduction

Is there any "real" number that may not actually be a real because we haven't found its Dedekind cut?

Trending Questions

Popular # Hahtags

Popular Questions