Question

find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+...+T(\frac n {2^k})$

score 435 · Answer 1 · 2026-03-30 07:27:57

435

Views

find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+...+T(\frac n {2^k})$

Published on 30 Mar 2026 - 7:27

score 123 · Answer 2 · 2026-04-02 15:26:11

123

Views

An effective coding of $\mathbb N^*$

Published on 02 Apr 2026 - 15:26

score 1k · Answer 3 · 2026-03-30 07:20:39

1k

Views

Recursion, multiplication and exponential

Published on 30 Mar 2026 - 7:20

score 450 · Answer 4 · 2013-11-22 00:55:00

450

Views

Discrete Mathematics - Recursion

Published on 22 Nov 2013 - 0:55

score 5.8k · Answer 5 · 2013-11-22 23:30:48

5.8k

Views

Prove that a recursive sequence is monotonically increasing

Published on 22 Nov 2013 - 23:30

score 61 · Answer 6 · 2026-04-02 17:29:36

61

Views

Two indexes $c$ and $b$, such that $Dom(\varphi_a)=\{b\}$ and $Dom(\varphi_b)=\{c\}$

Published on 02 Apr 2026 - 17:29

score 339 · Answer 7 · 2026-04-02 17:35:01

339

Views

Induction on Primitive Recursive Function

Published on 02 Apr 2026 - 17:35

score 42 · Answer 8 · 2013-11-24 21:38:39

42

Views

A question on combinatorics

Published on 24 Nov 2013 - 21:38

score 70 · Answer 9 · 2026-04-03 06:55:04

70

Views

Prove that for any $m, n \in\omega$ that (i) $m + 0 = m$, (ii) $m + n^+ = (m + n)^+$

Published on 03 Apr 2026 - 6:55

score 537 · Answer 10 · 2013-11-27 15:43:38

537

Views

Combinatorics recursion question.

Published on 27 Nov 2013 - 15:43

score 184 · Answer 11 · 2013-11-28 01:23:41

184

Views

Primitive Recursion Functions (Programs)

Published on 28 Nov 2013 - 1:23

score 74 · Answer 12 · 2013-12-10 08:13:01

74

Views

Let $x$ be a real number. To prove...

Published on 10 Dec 2013 - 8:13

score 1.3k · Answer 13 · 2026-04-02 19:11:56

1.3k

Views

All infinite recursive sets can be enumerated by an injective function

Published on 02 Apr 2026 - 19:11

score 1.3k · Answer 14 · 2026-04-02 19:13:30

1.3k

Views

An effective enumeration of recursive sets in increasing order

Published on 02 Apr 2026 - 19:13

score 155 · Answer 15 · 2013-12-11 22:33:34

155

Views

Recursive Square Root Futility Closet

Published on 11 Dec 2013 - 22:33

List Question

find $O$ and $\Omega$ bounds as tight as possible for $T(n)=n+T(\frac n 2)+T(\frac n 4)+T(\frac n 8)+...+T(\frac n {2^k})$

An effective coding of $\mathbb N^*$

Recursion, multiplication and exponential

Discrete Mathematics - Recursion

Prove that a recursive sequence is monotonically increasing

Two indexes $c$ and $b$, such that $Dom(\varphi_a)=\{b\}$ and $Dom(\varphi_b)=\{c\}$

Induction on Primitive Recursive Function

A question on combinatorics

Prove that for any $m, n \in\omega$ that (i) $m + 0 = m$, (ii) $m + n^+ = (m + n)^+$

Combinatorics recursion question.

Primitive Recursion Functions (Programs)

Let $x$ be a real number. To prove...

All infinite recursive sets can be enumerated by an injective function

An effective enumeration of recursive sets in increasing order

Recursive Square Root Futility Closet

Trending Questions

Popular # Hahtags

Popular Questions