Question

Show that K and complement to K are "1-reducible" to EQ={⟨x,y⟩|φx≃φy}

score 337 · Answer 1 · 2012-12-09 15:45:56

337

Views

Show that K and complement to K are "1-reducible" to EQ={⟨x,y⟩|φx≃φy}

Published on 09 Dec 2012 - 15:45

score 378 · Answer 2 · 2012-12-10 03:49:21

378

Views

IF a language L logspace reduces to SAT, does L

Published on 10 Dec 2012 - 3:49

score 137 · Answer 3 · 2012-12-10 23:36:20

137

Views

Is the halting of a program that checks for duplicates in an infinite multiset decidable?

Published on 10 Dec 2012 - 23:36

score 588 · Answer 4 · 2012-12-16 04:52:27

588

Views

Is there a function that only generates primes?

Published on 16 Dec 2012 - 4:52

score 244 · Answer 5 · 2012-12-19 20:47:41

244

Views

Primitive recursive select from parameters

Published on 19 Dec 2012 - 20:47

score 296 · Answer 6 · 2012-12-20 17:40:08

296

Views

Proving uncomputability -- Rice's theorem

Published on 20 Dec 2012 - 17:40

score 57 · Answer 7 · 2012-12-29 15:15:19

57

Views

Prove there exists a recursive language which no TM accepts in n steps.

Published on 29 Dec 2012 - 15:15

score 327 · Answer 8 · 2012-12-30 13:56:12

327

Views

Ordinals definable over $L_\kappa$

Published on 30 Dec 2012 - 13:56

score 1.6k · Answer 9 · 2012-12-30 13:56:22

1.6k

Views

Good introductory books on primitive recursive functions

Published on 30 Dec 2012 - 13:56

score 54 · Answer 10 · 2012-12-31 19:41:09

54

Views

Intuition for "identification" and "generalization" (computability theory)

Published on 31 Dec 2012 - 19:41

score 1.8k · Answer 11 · 2013-01-03 19:55:57

1.8k

Views

What is the relationship between ZFC and Turing machine?

Published on 03 Jan 2013 - 19:55

score 195 · Answer 12 · 2013-01-04 19:22:49

195

Views

Space : Kolmogorov complexity :: time and space : ___?

Published on 04 Jan 2013 - 19:22

score 2.9k · Answer 13 · 2013-01-05 22:27:33

2.9k

Views

Examples of Many-one reductions.

Published on 05 Jan 2013 - 22:27

score 304 · Answer 14 · 2013-01-06 23:23:13

304

Views

Proof that an inverse of a possibly noncomputable function is possibly not decidable

Published on 06 Jan 2013 - 23:23

score 8k · Answer 15 · 2013-01-06 23:58:54

8k

Views

What properties of busy beaver numbers are computable?

Published on 06 Jan 2013 - 23:58

List Question

Show that K and complement to K are "1-reducible" to EQ={⟨x,y⟩|φx≃φy}

IF a language L logspace reduces to SAT, does L

Is the halting of a program that checks for duplicates in an infinite multiset decidable?

Is there a function that only generates primes?

Primitive recursive select from parameters

Proving uncomputability -- Rice's theorem

Prove there exists a recursive language which no TM accepts in n steps.

Ordinals definable over $L_\kappa$

Good introductory books on primitive recursive functions

Intuition for "identification" and "generalization" (computability theory)

What is the relationship between ZFC and Turing machine?

Space : Kolmogorov complexity :: time and space : ___?

Examples of Many-one reductions.

Proof that an inverse of a possibly noncomputable function is possibly not decidable

What properties of busy beaver numbers are computable?

Trending Questions

Popular # Hahtags

Popular Questions