Question

Show that Turing recognizable languages are closed under intersection.

score 7.4k · Answer 1 · 2026-03-17 21:07:49

7.4k

Views

Show that Turing recognizable languages are closed under intersection.

Published on 17 Mar 2026 - 21:07

score 3.4k · Answer 2 · 2026-03-25 01:23:23

3.4k

Views

How can we know we're not accidentally talking about non-standard integers?

Published on 25 Mar 2026 - 1:23

score 408 · Answer 3 · 2026-03-25 04:36:42

408

Views

Is generating a Turing Machine that output a given string $s$ in NP?

Published on 25 Mar 2026 - 4:36

score 3.9k · Answer 4 · 2026-03-17 10:54:10

3.9k

Views

Turing machine which deletes half of input

Published on 17 Mar 2026 - 10:54

score 838 · Answer 5 · 2026-03-16 22:31:02

838

Views

Turing machine for any language

Published on 16 Mar 2026 - 22:31

score 2.2k · Answer 6 · 2026-03-12 12:07:55

2.2k

Views

Show that single-tape TMs that cannot write on the portion of the tape containing the input string recognizes only regular languages.

Published on 12 Mar 2026 - 12:07

score 75 · Answer 7 · 2026-03-24 20:30:27

75

Views

SVM dual optimization extra constraint

Published on 24 Mar 2026 - 20:30

score 146 · Answer 8 · 2026-03-23 04:03:43

146

Views

Any non-standard halting oracles stronger than $\mathbb N$?

Published on 23 Mar 2026 - 4:03

score 115 · Answer 9 · 2026-03-12 09:47:44

115

Views

A difficulty in understanding that every multitape TM is equivalent to a single tape TM.

Published on 12 Mar 2026 - 9:47

score 151 · Answer 10 · 2026-03-17 21:19:29

151

Views

Can the sequence of states of a non-halting Turing machine describe an irrational / transcendental number?

Published on 17 Mar 2026 - 21:19

score 193 · Answer 11 · 2026-03-23 11:39:12

193

Views

Church's thesis for oracle computations

Published on 23 Mar 2026 - 11:39

score 2.1k · Answer 12 · 2026-03-12 10:02:21

2.1k

Views

Proof that $\textit{INFINITE}_{\text{DFA}}$ is decidable.(Sipser Q.4.10)

Published on 12 Mar 2026 - 10:02

score 225 · Answer 13 · 2026-03-19 23:37:55

225

Views

Turing machine - Reducible

Published on 19 Mar 2026 - 23:37

score 1.7k · Answer 14 · 2026-03-17 21:34:15

1.7k

Views

Busy Beaver function growth rate compared to computable functions

Published on 17 Mar 2026 - 21:34

score 1k · Answer 15 · 2026-03-23 10:39:26

1k

Views

Classify language as decidable, undecidable but recognisable or unrecognizable

Published on 23 Mar 2026 - 10:39

List Question

Show that Turing recognizable languages are closed under intersection.

How can we know we're not accidentally talking about non-standard integers?

Is generating a Turing Machine that output a given string $s$ in NP?

Turing machine which deletes half of input

Turing machine for any language

Show that single-tape TMs that cannot write on the portion of the tape containing the input string recognizes only regular languages.

SVM dual optimization extra constraint

Any non-standard halting oracles stronger than $\mathbb N$?

A difficulty in understanding that every multitape TM is equivalent to a single tape TM.

Can the sequence of states of a non-halting Turing machine describe an irrational / transcendental number?

Church's thesis for oracle computations

Proof that $\textit{INFINITE}_{\text{DFA}}$ is decidable.(Sipser Q.4.10)

Turing machine - Reducible

Busy Beaver function growth rate compared to computable functions

Classify language as decidable, undecidable but recognisable or unrecognizable

Trending Questions

Popular # Hahtags

Popular Questions