Question

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

score 392 · Answer 1 · 2026-03-24 23:44:54

392

Views

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

Published on 24 Mar 2026 - 23:44

score 274 · Answer 2 · 2026-03-17 15:09:12

274

Views

Is there actually a universal notion of computability?

Published on 17 Mar 2026 - 15:09

score 106 · Answer 3 · 2026-03-17 00:02:58

106

Views

Why is this TM problem decidable

Published on 17 Mar 2026 - 0:02

score 749 · Answer 4 · 2026-03-23 03:21:53

749

Views

Every Turing machine corresponds to a formal system

Published on 23 Mar 2026 - 3:21

score 58 · Answer 5 · 2018-05-14 20:27:35

58

Views

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

Published on 14 May 2018 - 20:27

score 110 · Answer 6 · 2026-03-17 21:48:55

110

Views

Do given Turing Machines M,N accepts equinumerous languages?

Published on 17 Mar 2026 - 21:48

score 121 · Answer 7 · 2026-03-17 19:14:46

121

Views

Does solving the complexity class ALL collapse all Turing degrees?

Published on 17 Mar 2026 - 19:14

score 117 · Answer 8 · 2018-05-21 16:45:36

117

Views

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

Published on 21 May 2018 - 16:45

score 50 · Answer 9 · 2018-05-21 17:22:42

50

Views

Classes of TMs for which we can solve the halting problem

Published on 21 May 2018 - 17:22

score 172 · Answer 10 · 2026-03-22 10:14:15

172

Views

What words does this Turing-machine produce?

Published on 22 Mar 2026 - 10:14

score 819 · Answer 11 · 2026-03-16 22:11:20

819

Views

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

Published on 16 Mar 2026 - 22:11

score 103 · Answer 12 · 2018-05-30 10:31:35

103

Views

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

Published on 30 May 2018 - 10:31

score 106 · Answer 13 · 2026-03-21 22:06:26

106

Views

Dealing with Turing Machines

Published on 21 Mar 2026 - 22:06

score 43 · Answer 14 · 2018-06-04 21:20:39

43

Views

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

Published on 04 Jun 2018 - 21:20

score 436 · Answer 15 · 2026-03-25 01:27:58

436

Views

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

Published on 25 Mar 2026 - 1:27

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