Computer Science Stack Exchange

0

votes

1

answer

113

views

Can a PDA guess more than once? L = {aⁿ bⁱ aⁿ | i,n > 0 }

computability

modified 2 days ago Community♦ 1

130

votes

3

answers

13k

views

How can it be decidable whether $\pi$ has some sequence of digits?

computability undecidability

modified 2 days ago David Richerby 70.9k

27

votes

4

answers

4k

views

What did Turing mean when saying that “machines cannot give rise to surprises” is due to a fallacy?

turing-machines computability computation-models

modified Apr 22 at 15:47 mowwwalker 219

0

votes

1

answer

48

views

Computability - The language of all strings of even length

turing-machines computability

modified Apr 22 at 7:45 Ran G. 16.9k

-1

votes

1

answer

50

views

Does solving all Halting problem instances 'in the limit' imply we solve an undecidable problem?

computability halting-problem network-topology

answered Apr 20 at 12:15 Discrete lizard♦ 4,798

1

vote

1

answer

38

views

Can the notation for polynomial reduction, A ≤p B be reversed in computability theory?

computability notation

answered Apr 19 at 13:12 lox 569

-2

votes

0

answers

84

views

Turing Machine the undecidable language

turing-machines computability automata

modified Apr 19 at 10:22 xskxzr 4,367

4

votes

3

answers

403

views

Decidability of the TM's computing a non-empty subset of total functions

computability turing-machines reductions undecidability

modified Apr 18 at 18:03 Community♦ 1

0

votes

1

answer

680

views

How would one reduce HaltTM to ATM

turing-machines computability reductions

modified Apr 18 at 15:56 Anwar Saiah 110

1

vote

1

answer

50

views

Proving $L = \{\langle M, w, n \rangle$ : $M$ accepts $w$ within $n$ steps $\}$ is decidable

turing-machines computability decision-problem

answered Apr 16 at 6:38 oerpli 431

0

votes

1

answer

89

views

Prove/disprove that the class of decidable (resp. partially decidable) languages is closed under symmetric difference

complexity-theory computability sets semi-decidability

modified Apr 14 at 1:01 Community♦ 1

4

votes

5

answers

2k

views

Prove if $L = \{0^m1^n \mid m \neq n\}$ is regular or not

computability automata finite-automata pumping-lemma

modified Apr 12 at 18:16 Yuval Filmus 197k

3

votes

1

answer

145

views

Recursion Tree Analysis by Leaves

computability asymptotics recurrence-relation

answered Apr 11 at 23:24 Yuval Filmus 197k

2

votes

1

answer

31

views

Construct a decidable set $B$ such that $B \neq A_w$ for any $w \in \Sigma^\star$

formal-languages turing-machines computability

answered Apr 10 at 5:42 Apass.Jack 14.6k

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

Can a PDA guess more than once? L = {aⁿ bⁱ aⁿ | i,n > 0 }

How can it be decidable whether $\pi$ has some sequence of digits?

What did Turing mean when saying that “machines cannot give rise to surprises” is due to a fallacy?

Computability - The language of all strings of even length

Does solving all Halting problem instances 'in the limit' imply we solve an undecidable problem?

Can the notation for polynomial reduction, A ≤p B be reversed in computability theory?

Turing Machine the undecidable language

Decidability of the TM's computing a non-empty subset of total functions

How would one reduce HaltTM to ATM

Proving $L = \{\langle M, w, n \rangle$ : $M$ accepts $w$ within $n$ steps $\}$ is decidable

Prove/disprove that the class of decidable (resp. partially decidable) languages is closed under symmetric difference

Prove if $L = \{0^m1^n \mid m \neq n\}$ is regular or not

Recursion Tree Analysis by Leaves

Construct a decidable set $B$ such that $B \neq A_w$ for any $w \in \Sigma^\star$

Hot Network Questions