Question

Show that Turing recognizable languages are closed under intersection.

score 7.4k · Answer 1 · 2026-04-12 13:37:52

7.4k

Views

Show that Turing recognizable languages are closed under intersection.

Published on 12 Apr 2026 - 13:37

score 3.4k · Answer 2 · 2026-05-10 11:41:41

3.4k

Views

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

Published on 10 May 2026 - 11:41

score 411 · Answer 3 · 2026-05-07 17:10:02

411

Views

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

Published on 07 May 2026 - 17:10

score 3.9k · Answer 4 · 2026-04-12 09:44:11

3.9k

Views

Turing machine which deletes half of input

Published on 12 Apr 2026 - 9:44

score 842 · Answer 5 · 2026-04-09 12:36:18

842

Views

Turing machine for any language

Published on 09 Apr 2026 - 12:36

score 2.2k · Answer 6 · 2026-04-15 08:15:12

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 15 Apr 2026 - 8:15

score 77 · Answer 7 · 2026-04-11 11:17:05

77

Views

SVM dual optimization extra constraint

Published on 11 Apr 2026 - 11:17

score 155 · Answer 8 · 2026-04-29 12:46:17

155

Views

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

Published on 29 Apr 2026 - 12:46

score 118 · Answer 9 · 2026-04-15 17:55:22

118

Views

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

Published on 15 Apr 2026 - 17:55

score 152 · Answer 10 · 2026-03-25 06:12:59

152

Views

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

Published on 25 Mar 2026 - 6:12

score 204 · Answer 11 · 2026-04-21 09:58:54

204

Views

Church's thesis for oracle computations

Published on 21 Apr 2026 - 9:58

score 2.1k · Answer 12 · 2026-04-16 09:54:17

2.1k

Views

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

Published on 16 Apr 2026 - 9:54

score 232 · Answer 13 · 2026-04-17 14:35:25

232

Views

Turing machine - Reducible

Published on 17 Apr 2026 - 14:35

score 1.7k · Answer 14 · 2026-04-10 15:20:32

1.7k

Views

Busy Beaver function growth rate compared to computable functions

Published on 10 Apr 2026 - 15:20

score 1k · Answer 15 · 2026-04-21 04:00:54

1k

Views

Classify language as decidable, undecidable but recognisable or unrecognizable

Published on 21 Apr 2026 - 4:00

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