Question

if I find a bijection, rather than it is computable or not even computable, then the set would be denumerable or not?

score 392 · Answer 1 · 2014-03-01 06:23:00

if I find a bijection, rather than it is computable or not even computable, then the set would be denumerable or not?

score 1.6k · Answer 2 · 2026-03-28 20:53:04

1.6k

Views

Decidability of Recursively Enumerable Languages

Published on 28 Mar 2026 - 20:53

score 476 · Answer 3 · 2026-04-02 01:54:47

476

Views

Existence of a utility function on the reals

Published on 02 Apr 2026 - 1:54

score 153 · Answer 4 · 2014-03-11 10:35:51

153

Views

Polytime implementation of Discrete Log using primitive recursive functions

Published on 11 Mar 2014 - 10:35

score 336 · Answer 5 · 2017-04-10 15:40:54

336

Views

Show that function is primitive recursive.

Published on 10 Apr 2017 - 15:40

score 93 · Answer 6 · 2026-02-23 15:31:22

93

Views

What is true about the languages $L1$ and $L2$?

Published on 23 Feb 2026 - 15:31

score 362 · Answer 7 · 2017-04-16 00:03:30

362

Views

programming language with HALTS keyword

Published on 16 Apr 2017 - 0:03

score 76 · Answer 8 · 2017-04-19 08:05:39

76

Views

Interesting events in $\{-1,1\}^{\mathbb{N}}$ of IID bernoullis, with nontrivial probability.

Published on 19 Apr 2017 - 8:05

score 59 · Answer 9 · 2017-04-19 16:04:51

59

Views

How to show the following problem is undecidable without Rice's theorem?

Published on 19 Apr 2017 - 16:04

score 81 · Answer 10 · 2026-03-28 16:59:53

81

Views

Decidability of equations in True Arithmetic

Published on 28 Mar 2026 - 16:59

score 262 · Answer 11 · 2017-04-20 07:53:58

262

Views

Classifying sets into arithmetic hierarchy

Published on 20 Apr 2017 - 7:53

score 70 · Answer 12 · 2017-04-25 18:21:01

70

Views

Counterexample to the uniformization principle for $\Pi^0_1$ relations

Published on 25 Apr 2017 - 18:21

score 288 · Answer 13 · 2017-04-27 04:00:00

288

Views

What is the most parsimonious model of natural number computation?

Published on 27 Apr 2017 - 4:00

score 1k · Answer 14 · 2017-04-27 06:55:46

1k

Views

Relationship of consistency, axiomatizability, and decidability

Published on 27 Apr 2017 - 6:55

score 514 · Answer 15 · 2026-03-28 17:39:30

514

Views

Uncomputable is Necessarily Transcendental?

Published on 28 Mar 2026 - 17:39

List Question

if I find a bijection, rather than it is computable or not even computable, then the set would be denumerable or not?

Decidability of Recursively Enumerable Languages

Existence of a utility function on the reals

Polytime implementation of Discrete Log using primitive recursive functions

Show that function is primitive recursive.

What is true about the languages $L1$ and $L2$?

programming language with HALTS keyword

Interesting events in $\{-1,1\}^{\mathbb{N}}$ of IID bernoullis, with nontrivial probability.

How to show the following problem is undecidable without Rice's theorem?

Decidability of equations in True Arithmetic

Classifying sets into arithmetic hierarchy

Counterexample to the uniformization principle for $\Pi^0_1$ relations

What is the most parsimonious model of natural number computation?

Relationship of consistency, axiomatizability, and decidability

Uncomputable is Necessarily Transcendental?

Trending Questions

Popular # Hahtags

Popular Questions