Computer Science Stack Exchange

2 votes

1 answer

33 views

Upper bound on output of halting transducer

Andrej Bauer

30k

modified 14 hours ago

4 votes

1 answer

224 views

Are any "standard" complexity classes uncountably infinite?

Vladimir Lysikov

211

answered yesterday

0 votes

0 answers

26 views

Help understanding the proof that $L = \{ \langle M \rangle \mid M \text{ is a TM that accepts the input string } 101\}$ is undecidable

codeing_monkey

1

modified 2 days ago

0 votes

1 answer

93 views

Why can't humans translate all of their abilities into an algorithm? Will that hold true in the future?

DirkT

847

answered Dec 7 at 16:32

0 votes

1 answer

39 views

Computability = Enumerating a sequence in the particular order?

CommunityBot

1

modified Nov 30 at 16:00

0 votes

1 answer

316 views

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

CommunityBot

1

modified Nov 29 at 4:04

0 votes

1 answer

1k views

Turing machine that recognizes the language $\{a^{n}b^{2n}c^{3n}|\ n\ge0\}$

Mohit-Aasirwal

1

answered Nov 27 at 8:54

3 votes

1 answer

110 views

For which values of $k$ is a $k$-state-bounded version of the halting problem decidable?

CommunityBot

1

modified Nov 20 at 17:07

0 votes

1 answer

118 views

Determining recursive enumerability of given languages

CommunityBot

1

modified Nov 18 at 14:06

0 votes

0 answers

19 views

Does valid value in L2 have to be gotten from L1 when we have a Many-One Reduction from L1 to L2

River Uzoma

1

asked Nov 15 at 3:38

0 votes

1 answer

30 views

Can an unreocognizable language be Turing-reducible to a recognizable language?

chi

14.4k

answered Nov 14 at 9:53

1 vote

1 answer

35 views

function is computable iff its graph is recursively enumerable?

Ali Dastjerdi

16

answered Nov 13 at 15:00

-1 votes

0 answers

32 views

Is it possible to compute the differentiation of any differentiable function on an interval?

someone

9

asked Nov 11 at 5:02

1 vote

1 answer

52 views

If the Navier-Stokes equations problem is a computable problem, for example a set/language called "L", what are the elements of L?

Alex Meiburg

923

answered Nov 9 at 18:32

Stack Exchange Network

Explore our questions

Upper bound on output of halting transducer

Are any "standard" complexity classes uncountably infinite?

Help understanding the proof that $L = \{ \langle M \rangle \mid M \text{ is a TM that accepts the input string } 101\}$ is undecidable

Why can't humans translate all of their abilities into an algorithm? Will that hold true in the future?

Computability = Enumerating a sequence in the particular order?

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

Turing machine that recognizes the language $\{a^{n}b^{2n}c^{3n}|\ n\ge0\}$

For which values of $k$ is a $k$-state-bounded version of the halting problem decidable?

Determining recursive enumerability of given languages

Does valid value in L2 have to be gotten from L1 when we have a Many-One Reduction from L1 to L2

Can an unreocognizable language be Turing-reducible to a recognizable language?

function is computable iff its graph is recursively enumerable?

Is it possible to compute the differentiation of any differentiable function on an interval?

If the Navier-Stokes equations problem is a computable problem, for example a set/language called "L", what are the elements of L?

Hot Network Questions