Computer Science Stack Exchange

0 votes

0 answers

5 views

is this a contradiction? "stating there are an infinite number of programs but that a program cannot be infinitely long is a contradiction"

Dylan Robertson

1

asked 17 mins ago

1 vote

6 answers

2k views

David Deutsch says "number of atoms in universe is finite", but then says "number of programs of all finite lengths is infinite". Contradiction?

zwol

297

modified 6 hours ago

2 votes

1 answer

34 views

Upper bound on output of halting transducer

Andrej Bauer

30k

modified 15 hours ago

1 vote

1 answer

35 views

If A U B and A ∩ B are recognizable, then is one of A, A', B, B' also recognizable?

Rémi

118

modified 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

857

answered Dec 7 at 16:32

-1 votes

2 answers

322 views

What are the practical examples of Semidecidable problems? Is NP problem a semidecidable problem?

gnasher729

28.4k

answered Dec 5 at 16:46

1 vote

1 answer

57 views

Is the set of instances of PCP, which have a solution, semi-decidable?

user1868607

2,184

answered Dec 5 at 14:56

2 votes

1 answer

2k views

How would a Turing Machine recognize n consecutive characters

CommunityBot

1

modified Dec 5 at 11:07

0 votes

0 answers

14 views

"Transforming" a Turing machine into another turing machine

Theorynoob

11

asked Dec 4 at 18:58

0 votes

0 answers

62 views

Designing a Turing machine (TM) to multiply a unary number by 2

Saeba Ryo

1

modified Dec 3 at 6:02

1 vote

1 answer

20 views

How is $\mathsf{RP\cap UP}$ not a class containing only unsatisfying languages?

Yuval Filmus

275k

answered Dec 2 at 13:41

0 votes

0 answers

23 views

Proving $A_{TM}$ is mapping reducible to certain language

Yarin

229

asked Dec 1 at 20:58

0 votes

1 answer

70 views

Prove/disprove that if $L_1, L_2\in RE$ then $L_1-\ L_2, L_1 - \bar{L_2}\in RE$

CommunityBot

1

modified Nov 29 at 19:02

Stack Exchange Network

Explore our questions

is this a contradiction? "stating there are an infinite number of programs but that a program cannot be infinitely long is a contradiction"

David Deutsch says "number of atoms in universe is finite", but then says "number of programs of all finite lengths is infinite". Contradiction?

Upper bound on output of halting transducer

If A U B and A ∩ B are recognizable, then is one of A, A', B, B' also recognizable?

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?

What are the practical examples of Semidecidable problems? Is NP problem a semidecidable problem?

Is the set of instances of PCP, which have a solution, semi-decidable?

How would a Turing Machine recognize n consecutive characters

"Transforming" a Turing machine into another turing machine

Designing a Turing machine (TM) to multiply a unary number by 2

How is $\mathsf{RP\cap UP}$ not a class containing only unsatisfying languages?

Proving $A_{TM}$ is mapping reducible to certain language

Prove/disprove that if $L_1, L_2\in RE$ then $L_1-\ L_2, L_1 - \bar{L_2}\in RE$

Hot Network Questions