Question

Can anyone explain this paper :? " The world problem: on the computability of the topology of 4-manifolds"

score 210 · Answer 1 · 2021-12-07 22:11:49

210

Views

Can anyone explain this paper :? " The world problem: on the computability of the topology of 4-manifolds"

Published on 07 Dec 2021 - 22:11

score 404 · Answer 2 · 2026-04-01 16:19:26

404

Views

how can prove $n^n$ is primitive recursive

Published on 01 Apr 2026 - 16:19

score 70 · Answer 3 · 2021-12-09 22:47:51

70

Views

Can one capture the properties of Turing machine using only function definitions?

Published on 09 Dec 2021 - 22:47

score 44 · Answer 4 · 2026-03-30 07:11:38

44

Views

Is it true that, for any $X$ Polish uncountable, every boldface class of $X$ is lightface with respect to some oracle?

Published on 30 Mar 2026 - 7:11

score 429 · Answer 5 · 2026-02-24 03:37:59

429

Views

How to show that if there's a mapping reduction from L to its complement, it doesn't imply that L∈R?

Published on 24 Feb 2026 - 3:37

score 108 · Answer 6 · 2021-12-22 01:56:10

108

Views

When is an infinite series computable?

Published on 22 Dec 2021 - 1:56

score 279 · Answer 7 · 2026-04-04 01:52:41

279

Views

Can we compute all digits of the Euler-Mascheroni constant?

Published on 04 Apr 2026 - 1:52

score 131 · Answer 8 · 2021-12-22 20:17:45

131

Views

finding the computable function in s-m-n theorem.

Published on 22 Dec 2021 - 20:17

score 120 · Answer 9 · 2026-02-24 03:36:38

120

Views

The range of a non-computable function that grows faster than computable functions is undecidable

Published on 24 Feb 2026 - 3:36

score 91 · Answer 10 · 2021-12-28 00:40:50

91

Views

Is there a rote algorithm to tell whether a tensor (of two vectors) can be reduced to an elementary tensor?

Published on 28 Dec 2021 - 0:40

score 149 · Answer 11 · 2026-03-30 04:25:32

149

Views

Running an infinite amount of Turing Machine steps in a finite amount of time: What consequences?

Published on 30 Mar 2026 - 4:25

score 82 · Answer 12 · 2026-03-30 04:25:21

82

Views

turing-reduction Proof: $A = \{(u,v) | T(M_u) \subseteq T(M_v)\}$ by showing $H_0 \leq A$

Published on 30 Mar 2026 - 4:25

score 111 · Answer 13 · 2022-01-03 23:09:13

111

Views

Is there a function that grows faster than all computable functions but does not have this property?

Published on 03 Jan 2022 - 23:09

score 217 · Answer 14 · 2026-03-29 10:16:44

217

Views

Kunen exercise IV.4.13 (4): Topological version of effective AC

Published on 29 Mar 2026 - 10:16

score 420 · Answer 15 · 2026-03-30 04:24:52

420

Views

Intuitve Proof that the halting set is recursively enumerable

Published on 30 Mar 2026 - 4:24

List Question

Can anyone explain this paper :? " The world problem: on the computability of the topology of 4-manifolds"

how can prove $n^n$ is primitive recursive

Can one capture the properties of Turing machine using only function definitions?

Is it true that, for any $X$ Polish uncountable, every boldface class of $X$ is lightface with respect to some oracle?

How to show that if there's a mapping reduction from L to its complement, it doesn't imply that L∈R?

When is an infinite series computable?

Can we compute all digits of the Euler-Mascheroni constant?

finding the computable function in s-m-n theorem.

The range of a non-computable function that grows faster than computable functions is undecidable

Is there a rote algorithm to tell whether a tensor (of two vectors) can be reduced to an elementary tensor?

Running an infinite amount of Turing Machine steps in a finite amount of time: What consequences?

turing-reduction Proof: $A = \{(u,v) | T(M_u) \subseteq T(M_v)\}$ by showing $H_0 \leq A$

Is there a function that grows faster than all computable functions but does not have this property?

Kunen exercise IV.4.13 (4): Topological version of effective AC

Intuitve Proof that the halting set is recursively enumerable

Trending Questions

Popular # Hahtags

Popular Questions