Question

If $f(x)$ is defined nowhere, and $z(x)$ is zero everywhere, then what is $f(x)z(x)$?

score 43 · Answer 1 · 2018-05-02 13:34:49

43

Views

If $f(x)$ is defined nowhere, and $z(x)$ is zero everywhere, then what is $f(x)z(x)$?

Published on 02 May 2018 - 13:34

score 39 · Answer 2 · 2018-05-05 14:28:06

39

Views

What is a Gödel numbering for the free group $F_S$, when $S$ is finite?

Published on 05 May 2018 - 14:28

score 48 · Answer 3 · 2018-05-09 08:44:49

48

Views

question about m-degrees : Is $<_m$ except $\{\mathbb{N} \}$, $\{\emptyset\}$ total order?

Published on 09 May 2018 - 8:44

score 204 · Answer 4 · 2026-03-22 20:10:00

204

Views

Is the set of finite groups primitive recursive?

Published on 22 Mar 2026 - 20:10

score 98 · Answer 5 · 2026-03-22 16:15:19

98

Views

A productive set contains an infinite r.e. set.

Published on 22 Mar 2026 - 16:15

score 1.2k · Answer 6 · 2026-03-25 07:43:15

1.2k

Views

Show that $f(x) = \lfloor \sqrt{2} \cdot x\rfloor$ is primitive recursive function.

Published on 25 Mar 2026 - 7:43

score 257 · Answer 7 · 2018-05-11 18:33:33

257

Views

Are any of the counterintuitive functions whose existence is postulated by the axiom of choice computable?

Published on 11 May 2018 - 18:33

score 305 · Answer 8 · 2018-05-13 07:49:55

305

Views

I need reference proving Turing computable function with oracle of $\chi_A$ is $A$-recursive

Published on 13 May 2018 - 7:49

score 110 · Answer 9 · 2026-03-17 21:48:55

110

Views

Do given Turing Machines M,N accepts equinumerous languages?

Published on 17 Mar 2026 - 21:48

score 221 · Answer 10 · 2026-03-17 17:01:49

221

Views

Definition of (lazy) conditional in partial recursive functions

Published on 17 Mar 2026 - 17:01

score 121 · Answer 11 · 2026-03-17 19:14:46

121

Views

Does solving the complexity class ALL collapse all Turing degrees?

Published on 17 Mar 2026 - 19:14

score 173 · Answer 12 · 2026-03-17 18:38:36

173

Views

Decidability if a given expression is equal to a prime number

Published on 17 Mar 2026 - 18:38

score 51 · Answer 13 · 2026-03-25 07:49:16

51

Views

Classes of TMs for which we can solve the halting problem

Published on 25 Mar 2026 - 7:49

score 1.4k · Answer 14 · 2018-05-22 17:43:31

1.4k

Views

Does there exist an uncountably infinite language?

Published on 22 May 2018 - 17:43

score 683 · Answer 15 · 2026-03-17 09:08:46

683

Views

Prove whether the problem is decidable

Published on 17 Mar 2026 - 9:08

List Question

If $f(x)$ is defined nowhere, and $z(x)$ is zero everywhere, then what is $f(x)z(x)$?

What is a Gödel numbering for the free group $F_S$, when $S$ is finite?

question about m-degrees : Is $<_m$ except $\{\mathbb{N} \}$, $\{\emptyset\}$ total order?

Is the set of finite groups primitive recursive?

A productive set contains an infinite r.e. set.

Show that $f(x) = \lfloor \sqrt{2} \cdot x\rfloor$ is primitive recursive function.

Are any of the counterintuitive functions whose existence is postulated by the axiom of choice computable?

I need reference proving Turing computable function with oracle of $\chi_A$ is $A$-recursive

Do given Turing Machines M,N accepts equinumerous languages?

Definition of (lazy) conditional in partial recursive functions

Does solving the complexity class ALL collapse all Turing degrees?

Decidability if a given expression is equal to a prime number

Classes of TMs for which we can solve the halting problem

Does there exist an uncountably infinite language?

Prove whether the problem is decidable

Trending Questions

Popular # Hahtags

Popular Questions