Question

Prove that there are two non-computable functions whose product is a computable function

score 162 · Answer 1 · 2026-03-29 14:57:14

162

Views

Prove that there are two non-computable functions whose product is a computable function

Published on 29 Mar 2026 - 14:57

score 85 · Answer 2 · 2020-09-24 18:29:03

85

Views

Can every computable number be written as a limit of a termwise-definable sequence?

Published on 24 Sep 2020 - 18:29

score 322 · Answer 3 · 2020-09-26 10:10:22

322

Views

About alternative proofs of max function is primitive recursive

Published on 26 Sep 2020 - 10:10

score 64 · Answer 4 · 2020-09-28 15:03:12

How to prove that replacing $f(x)$ with $f(g(x))$ in primitive recursion scheme still yields a primitive recursive function if $g$ is "decreasing"?

score 133 · Answer 5 · 2026-03-27 04:04:51

133

Views

Finitely presented group with intermediate Turing degree word problem

Published on 27 Mar 2026 - 4:04

score 936 · Answer 6 · 2026-03-25 07:40:58

936

Views

Infinite recursive graphs and different ways to build them

Published on 25 Mar 2026 - 7:40

score 46 · Answer 7 · 2020-10-03 23:38:57

46

Views

Proofs whose examples are impossible to be found

Published on 03 Oct 2020 - 23:38

score 167 · Answer 8 · 2026-04-01 05:08:20

167

Views

Prove existence of non-computable double argument function

Published on 01 Apr 2026 - 5:08

score 82 · Answer 9 · 2020-10-06 03:08:44

82

Views

Proof and algorithm formalizations

Published on 06 Oct 2020 - 3:08

score 33 · Answer 10 · 2020-10-06 08:58:09

33

Views

Find computable totally function $f: \mathbb{N} \rightarrow \mathbb{N} $ and solvable set $A$, when $f(A)$ will not be solvable.

Published on 06 Oct 2020 - 8:58

score 41 · Answer 11 · 2026-04-01 04:58:16

41

Views

Construct following semidecidable sets

Published on 01 Apr 2026 - 4:58

score 74 · Answer 12 · 2026-04-01 04:58:15

74

Views

Proof such recursive set existence.

Published on 01 Apr 2026 - 4:58

score 148 · Answer 13 · 2026-03-29 11:07:57

148

Views

Can ZFC decide more values of the Busy Beaver function than PA?

Published on 29 Mar 2026 - 11:07

score 62 · Answer 14 · 2026-04-01 05:03:35

62

Views

Build a chain of sets $(A_{k})_{k \in \mathbb{N}}$

Published on 01 Apr 2026 - 5:03

score 118 · Answer 15 · 2026-03-29 15:03:41

Prove that there are exists uncomputable partial function $U(n,x)$ such that $ \forall n \in N: U(n,x)$ and $U(x,n)$ are computable.

List Question

Prove that there are two non-computable functions whose product is a computable function

Can every computable number be written as a limit of a termwise-definable sequence?

About alternative proofs of max function is primitive recursive

How to prove that replacing $f(x)$ with $f(g(x))$ in primitive recursion scheme still yields a primitive recursive function if $g$ is "decreasing"?

Finitely presented group with intermediate Turing degree word problem

Infinite recursive graphs and different ways to build them

Proofs whose examples are impossible to be found

Prove existence of non-computable double argument function

Proof and algorithm formalizations

Find computable totally function $f: \mathbb{N} \rightarrow \mathbb{N} $ and solvable set $A$, when $f(A)$ will not be solvable.

Construct following semidecidable sets

Proof such recursive set existence.

Can ZFC decide more values of the Busy Beaver function than PA?

Build a chain of sets $(A_{k})_{k \in \mathbb{N}}$

Prove that there are exists uncomputable partial function $U(n,x)$ such that $ \forall n \in N: U(n,x)$ and $U(x,n)$ are computable.

Trending Questions

Popular # Hahtags

Popular Questions