Question

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

score 46 · Answer 1 · 2026-04-16 09:53:15

46

Views

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

Published on 16 Apr 2026 - 9:53

score 42 · Answer 2 · 2026-04-15 05:02:55

42

Views

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

Published on 15 Apr 2026 - 5:02

score 51 · Answer 3 · 2026-04-17 06:21:36

51

Views

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

Published on 17 Apr 2026 - 6:21

score 207 · Answer 4 · 2026-04-15 13:47:32

207

Views

Is the set of finite groups primitive recursive?

Published on 15 Apr 2026 - 13:47

score 101 · Answer 5 · 2026-04-16 03:25:56

101

Views

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

Published on 16 Apr 2026 - 3:25

score 1.2k · Answer 6 · 2026-04-14 03:20:41

1.2k

Views

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

Published on 14 Apr 2026 - 3:20

score 266 · Answer 7 · 2026-05-10 12:34:42

266

Views

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

Published on 10 May 2026 - 12:34

score 308 · Answer 8 · 2026-04-14 11:45:06

308

Views

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

Published on 14 Apr 2026 - 11:45

score 111 · Answer 9 · 2026-04-09 02:21:53

111

Views

Do given Turing Machines M,N accepts equinumerous languages?

Published on 09 Apr 2026 - 2:21

score 224 · Answer 10 · 2026-04-10 10:22:36

224

Views

Definition of (lazy) conditional in partial recursive functions

Published on 10 Apr 2026 - 10:22

score 122 · Answer 11 · 2026-04-09 02:26:07

122

Views

Does solving the complexity class ALL collapse all Turing degrees?

Published on 09 Apr 2026 - 2:26

score 174 · Answer 12 · 2026-04-09 02:21:49

174

Views

Decidability if a given expression is equal to a prime number

Published on 09 Apr 2026 - 2:21

score 54 · Answer 13 · 2026-05-10 16:02:03

54

Views

Classes of TMs for which we can solve the halting problem

Published on 10 May 2026 - 16:02

score 1.4k · Answer 14 · 2026-04-11 14:33:49

1.4k

Views

Does there exist an uncountably infinite language?

Published on 11 Apr 2026 - 14:33

score 684 · Answer 15 · 2026-04-09 02:23:32

684

Views

Prove whether the problem is decidable

Published on 09 Apr 2026 - 2:23

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