Question

With $f_i$ as enumeration of single-place primitive recursive functions, show that $F(n,m) = f_n(m)$ is not primitive recursive via diagonal argument

score 119 · Answer 1 · 2026-04-06 14:21:23

With $f_i$ as enumeration of single-place primitive recursive functions, show that $F(n,m) = f_n(m)$ is not primitive recursive via diagonal argument

score 120 · Answer 2 · 2021-04-05 08:16:00

120

Views

Why recursion solution not working here?

Published on 05 Apr 2021 - 8:16

score 454 · Answer 3 · 2021-04-05 11:56:28

454

Views

What is closed form of f when $f(n)=\frac{1}{f(n-1)}+f(n-2), f(2)=1, f(1)=0$?

Published on 05 Apr 2021 - 11:56

score 752 · Answer 4 · 2021-04-05 14:31:30

752

Views

How to solve the recurrence T(n) = 4 T (n/2) + n! using master theorem

Published on 05 Apr 2021 - 14:31

score 73 · Answer 5 · 2026-04-06 07:46:33

73

Views

Is there any easier algorithm in finding the eigenvalues of hollow matrix?

Published on 06 Apr 2026 - 7:46

score 227 · Answer 6 · 2026-03-26 16:06:52

227

Views

Is there a generalization of transfinite recursion that allows defining proper classes?

Published on 26 Mar 2026 - 16:06

score 224 · Answer 7 · 2026-04-06 14:16:38

224

Views

Show that the range of a monotone recursive function is a recursive set

Published on 06 Apr 2026 - 14:16

score 73 · Answer 8 · 2021-04-10 14:51:12

73

Views

Clarify on recursively enumerable sets

Published on 10 Apr 2021 - 14:51

score 84 · Answer 9 · 2021-04-11 13:48:41

84

Views

Method of solving the recursive relation, $T(n)=T(n/3)+T(2n/3)+n$

Published on 11 Apr 2021 - 13:48

score 32 · Answer 10 · 2026-03-29 11:07:06

32

Views

Solving a recursive geometric series by hand?

Published on 29 Mar 2026 - 11:07

score 62 · Answer 11 · 2021-04-14 00:10:50

62

Views

Coin Recurrence Game

Published on 14 Apr 2021 - 0:10

score 73 · Answer 12 · 2026-03-29 19:52:44

73

Views

How do I find what kind of language is expressed by the following sets?

Published on 29 Mar 2026 - 19:52

score 162 · Answer 13 · 2026-04-01 11:14:57

162

Views

How to solve this second-order non-linear recurrence relation?

Published on 01 Apr 2026 - 11:14

score 60 · Answer 14 · 2021-04-15 19:36:30

60

Views

Recurrence equation: $T(n) = 2T(n − 1) + (\log n)T([\log n]) + 1$

Published on 15 Apr 2021 - 19:36

score 94 · Answer 15 · 2021-04-16 14:34:01

94

Views

Find number of sequences of 7 letters such that every letter is equal to previous or next

Published on 16 Apr 2021 - 14:34

List Question

With $f_i$ as enumeration of single-place primitive recursive functions, show that $F(n,m) = f_n(m)$ is not primitive recursive via diagonal argument

Why recursion solution not working here?

What is closed form of f when $f(n)=\frac{1}{f(n-1)}+f(n-2), f(2)=1, f(1)=0$?

How to solve the recurrence T(n) = 4 T (n/2) + n! using master theorem

Is there any easier algorithm in finding the eigenvalues of hollow matrix?

Is there a generalization of transfinite recursion that allows defining proper classes?

Show that the range of a monotone recursive function is a recursive set

Clarify on recursively enumerable sets

Method of solving the recursive relation, $T(n)=T(n/3)+T(2n/3)+n$

Solving a recursive geometric series by hand?

Coin Recurrence Game

How do I find what kind of language is expressed by the following sets?

How to solve this second-order non-linear recurrence relation?

Recurrence equation: $T(n) = 2T(n − 1) + (\log n)T([\log n]) + 1$

Find number of sequences of 7 letters such that every letter is equal to previous or next

Trending Questions

Popular # Hahtags

Popular Questions