Question

Can turing machine solve halting problem on a pushdown automaton?

score 1.9k · Answer 1 · 2026-03-22 15:45:56

1.9k

Views

Can turing machine solve halting problem on a pushdown automaton?

Published on 22 Mar 2026 - 15:45

score 1.8k · Answer 2 · 2017-09-25 15:34:05

1.8k

Views

A Turing machine which computes $x^y$

Published on 25 Sep 2017 - 15:34

score 558 · Answer 3 · 2017-09-26 03:26:45

558

Views

Incomparable languages $B \nleq_T A$ and $A \nleq_T B$

Published on 26 Sep 2017 - 3:26

score 342 · Answer 4 · 2017-09-26 10:15:51

342

Views

Correlated halting of two Turing Machines

Published on 26 Sep 2017 - 10:15

score 3.3k · Answer 5 · 2017-09-30 15:36:18

3.3k

Views

Design a Turing machine which computes the sum of two numbers in base $2$

Published on 30 Sep 2017 - 15:36

score 163 · Answer 6 · 2026-02-23 17:21:05

163

Views

Recursion Theorem prime number

Published on 23 Feb 2026 - 17:21

score 286 · Answer 7 · 2026-02-23 17:21:04

286

Views

Prime number decidability: recursion theorem

Published on 23 Feb 2026 - 17:21

score 1k · Answer 8 · 2017-10-21 03:22:37

1k

Views

Why is there no computable function that grows faster than the sequence of Busy Beaver numbers?

Published on 21 Oct 2017 - 3:22

score 53 · Answer 9 · 2017-10-24 14:08:57

53

Views

Why does this algorithm not prove that a language is Turing recognisable?

Published on 24 Oct 2017 - 14:08

score 629 · Answer 10 · 2017-10-25 12:06:09

629

Views

Modify a Turing Machine

Published on 25 Oct 2017 - 12:06

score 3k · Answer 11 · 2017-10-27 01:46:58

3k

Views

How to prove that regular language is decidable

Published on 27 Oct 2017 - 1:46

score 707 · Answer 12 · 2026-02-23 17:24:36

707

Views

Proving the decidability of a language

Published on 23 Feb 2026 - 17:24

score 3.7k · Answer 13 · 2017-10-31 04:04:35

3.7k

Views

if A is turing-recognizable, and A is mapping reducible to complement of A, A is decidable

Published on 31 Oct 2017 - 4:04

score 225 · Answer 14 · 2017-11-03 01:16:17

225

Views

Turing machines with read-only stack and two stacks

Published on 03 Nov 2017 - 1:16

score 433 · Answer 15 · 2017-11-03 09:20:43

433

Views

How can we define the terms "computable" and "partially computable" for functions like $f:\mathbb N^k \to \mathbb N^m$

Published on 03 Nov 2017 - 9:20

List Question

Can turing machine solve halting problem on a pushdown automaton?

A Turing machine which computes $x^y$

Incomparable languages $B \nleq_T A$ and $A \nleq_T B$

Correlated halting of two Turing Machines

Design a Turing machine which computes the sum of two numbers in base $2$

Recursion Theorem prime number

Prime number decidability: recursion theorem

Why is there no computable function that grows faster than the sequence of Busy Beaver numbers?

Why does this algorithm not prove that a language is Turing recognisable?

Modify a Turing Machine

How to prove that regular language is decidable

Proving the decidability of a language

if A is turing-recognizable, and A is mapping reducible to complement of A, A is decidable

Turing machines with read-only stack and two stacks

How can we define the terms "computable" and "partially computable" for functions like $f:\mathbb N^k \to \mathbb N^m$

Trending Questions

Popular # Hahtags

Popular Questions