Computer Science Stack Exchange

4

votes

3

answers

279

views

Metagame Paradox: what is wrong with this explanation?

computability turing-machines game-theory

modified 3 hours ago Mike Rosoft 21

0

votes

0

answers

13

views

Uncomputably coded model of computation

turing-machines computability lambda-calculus computation-models turing-completeness

asked 8 hours ago Punga 1

1

vote

0

answers

72

views

+100

How does a Turing machine with one tape read its input?

turing-machines computability

modified 8 hours ago Yuval Filmus 202k

1

vote

1

answer

59

views

Is “Query Equivalence” decidable?

computability database-theory

answered yesterday Curtis F 507

5

votes

3

answers

205

views

Defining computable functions on arbitrary sets

computability computation-models encoding-scheme

modified Jun 12 at 14:24 Jason Hemann 1

1

vote

1

answer

38

views

Proving that the set of grammars generating L or L complement is undecidable

computability regular-languages context-free formal-grammars reductions

modified Jun 12 at 12:03 Community♦ 1

2

votes

1

answer

76

views

Can these two languages be reduced to one another?

turing-machines computability reductions

modified Jun 10 at 17:46 Yuval Filmus 202k

2

votes

1

answer

12

views

Proving a language comprised of 2 languages is regular(with suffix and prefix)

computability automata regular-languages finite-automata

answered Jun 10 at 13:47 Yuval Filmus 202k

4

votes

1

answer

16

views

Proving a language comprised of 2 languages is regular

computability automata regular-languages finite-automata

answered Jun 10 at 8:37 Yuval Filmus 202k

1

vote

1

answer

19

views

Prove/Disprove: Every two non-trivial NP-complete problems are decreasing reducible?

complexity-theory turing-machines computability np-complete reductions

answered Jun 9 at 16:48 Yuval Filmus 202k

2

votes

2

answers

59

views

Is finding a single digit of a computation is as hard as finding the computation?

turing-machines computability

modified Jun 9 at 14:16 Yuval Filmus 202k

6

votes

2

answers

8k

views

How to prove that a language is not recursively enumerable

computability proof-techniques semi-decidability

modified Jun 6 at 5:13 Discrete lizard♦ 5,183

1

vote

1

answer

28

views

Examples for Partial Combinatory Algebras

complexity-theory computability reference-request logic

answered Jun 5 at 13:58 Andrej Bauer 21k

1

vote

1

answer

36

views

Intersection of a recognizable language and a decidable language is decidable?

computability

Jun 4 at 0:39

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

Metagame Paradox: what is wrong with this explanation?

Uncomputably coded model of computation

How does a Turing machine with one tape read its input?

Is “Query Equivalence” decidable?

Defining computable functions on arbitrary sets

Proving that the set of grammars generating L or L complement is undecidable

Can these two languages be reduced to one another?

Proving a language comprised of 2 languages is regular(with suffix and prefix)

Proving a language comprised of 2 languages is regular

Prove/Disprove: Every two non-trivial NP-complete problems are decreasing reducible?

Is finding a single digit of a computation is as hard as finding the computation?

How to prove that a language is not recursively enumerable

Examples for Partial Combinatory Algebras

Intersection of a recognizable language and a decidable language is decidable?

Hot Network Questions