Question

Implementing the function $f(x)=\left[ 2x/3 \right]$ on Unlimited Register Machine

score 180 · Answer 1 · 2021-04-20 14:07:55

180

Views

Implementing the function $f(x)=\left[ 2x/3 \right]$ on Unlimited Register Machine

Published on 20 Apr 2021 - 14:07

score 54 · Answer 2 · 2021-04-23 07:27:53

54

Views

Is the relation "$A$ is r.e. (recursively enumerable) relative to $B$" transitive?

Published on 23 Apr 2021 - 7:27

score 25 · Answer 3 · 2021-04-24 00:54:01

25

Views

Is there any degree 0' language that is neither r.e. nor co-r.e.?

Published on 24 Apr 2021 - 0:54

score 25 · Answer 4 · 2021-04-24 01:48:42

25

Views

How to show if $A$ is simple, then $A\otimes N$ is r.e., but neither recursive, creative, nor simple?

Published on 24 Apr 2021 - 1:48

score 109 · Answer 5 · 2026-03-28 00:56:17

109

Views

Some observations about third-order functionals: any relationships between them?

Published on 28 Mar 2026 - 0:56

score 46 · Answer 6 · 2026-02-23 09:27:41

46

Views

Can you prove mu-recursive functions are Diophantine without bounded universal quantifiers?

Published on 23 Feb 2026 - 9:27

score 78 · Answer 7 · 2021-04-29 01:33:06

78

Views

Prove Complementary set is not recursive by reduction

Published on 29 Apr 2021 - 1:33

score 115 · Answer 8 · 2021-05-02 21:58:39

115

Views

Index Sets are Cylinders

Published on 02 May 2021 - 21:58

score 134 · Answer 9 · 2021-05-07 21:02:16

134

Views

Defining real numbers to exclude incomputable numbers

Published on 07 May 2021 - 21:02

score 59 · Answer 10 · 2021-05-11 18:57:46

Effective countability of a class defined recursively using a finite number of base elements and a finite number of closure operators

score 64 · Answer 11 · 2026-03-29 21:31:47

64

Views

Post's problem. Can we find explicit intermediate r.e sets?

Published on 29 Mar 2026 - 21:31

score 82 · Answer 12 · 2026-03-28 12:48:32

82

Views

Are there any results how well (deep) neural networks approximate the uncomputable functions?

Published on 28 Mar 2026 - 12:48

score 42 · Answer 13 · 2021-05-23 01:59:41

42

Views

Choosing an element of $W_x$ in a computable way

Published on 23 May 2021 - 1:59

score 133 · Answer 14 · 2026-03-29 21:26:38

133

Views

Where is the paradox in the halting problem

Published on 29 Mar 2026 - 21:26

score 288 · Answer 15 · 2021-05-29 10:09:54

288

Views

How to prove that a given set is recursively enumerable?

Published on 29 May 2021 - 10:09

List Question

Implementing the function $f(x)=\left[ 2x/3 \right]$ on Unlimited Register Machine

Is the relation "$A$ is r.e. (recursively enumerable) relative to $B$" transitive?

Is there any degree 0' language that is neither r.e. nor co-r.e.?

How to show if $A$ is simple, then $A\otimes N$ is r.e., but neither recursive, creative, nor simple?

Some observations about third-order functionals: any relationships between them?

Can you prove mu-recursive functions are Diophantine without bounded universal quantifiers?

Prove Complementary set is not recursive by reduction

Index Sets are Cylinders

Defining real numbers to exclude incomputable numbers

Effective countability of a class defined recursively using a finite number of base elements and a finite number of closure operators

Post's problem. Can we find explicit intermediate r.e sets?

Are there any results how well (deep) neural networks approximate the uncomputable functions?

Choosing an element of $W_x$ in a computable way

Where is the paradox in the halting problem

How to prove that a given set is recursively enumerable?

Trending Questions

Popular # Hahtags

Popular Questions