Question

Mathematically, how does one find the value of the Ackermann function in terms of n for a given m?

score 1.7k · Answer 1 · 2026-02-23 00:05:50

1.7k

Views

Mathematically, how does one find the value of the Ackermann function in terms of n for a given m?

Published on 23 Feb 2026 - 0:05

score 105 · Answer 2 · 2016-01-06 19:57:54

105

Views

Number of Hamilton paths in an extremely dense undirected simple graph

Published on 06 Jan 2016 - 19:57

score 254 · Answer 3 · 2016-01-07 13:19:24

254

Views

Give an upper bound for a function satisfying $f(n)=4f(n−1)+n$

Published on 07 Jan 2016 - 13:19

score 169 · Answer 4 · 2016-01-08 11:43:58

169

Views

Algorithm for equality of trees of restricted depth

Published on 08 Jan 2016 - 11:43

score 208 · Answer 5 · 2016-01-13 14:32:25

208

Views

Finding a solution to $\sum _{n=1}^{n=k} \frac{1}{n^x}+\sum _{n=1}^{n=k} \frac{1}{n^y}=0$

Published on 13 Jan 2016 - 14:32

score 134 · Answer 6 · 2016-01-23 14:22:28

134

Views

Is the definition of recursive function unchanged if we restrict substitution to binary composition?

Published on 23 Jan 2016 - 14:22

score 94 · Answer 7 · 2016-01-30 07:03:17

94

Views

How do you go about solving this recurrence?

Published on 30 Jan 2016 - 7:03

score 94 · Answer 8 · 2016-02-04 22:02:07

94

Views

Infinite series, continued fractions, nested radicals and such - is there a general recursive algorithm theory?

Published on 04 Feb 2016 - 22:02

score 446 · Answer 9 · 2016-02-08 20:29:56

446

Views

Solve the recurrence using the Master Theorem: $T(n) = 5T\left(\frac{n}{4}\right) + n\lg \lg n$

Published on 08 Feb 2016 - 20:29

score 2.3k · Answer 10 · 2026-03-29 10:01:20

2.3k

Views

Ackermann's Function

Published on 29 Mar 2026 - 10:01

score 48 · Answer 11 · 2016-02-23 00:53:09

48

Views

Is there a decimal based way to take roots or exponents?

Published on 23 Feb 2016 - 0:53

score 2.8k · Answer 12 · 2026-03-28 21:27:11

2.8k

Views

Compare five ways of solving cubic equation by iterations (nested expressions)

Published on 28 Mar 2026 - 21:27

score 3.9k · Answer 13 · 2016-02-26 01:33:30

3.9k

Views

How to solve recurrence $T(n) = T(n/3) + T(2n/3) +n$ using Master Theorem

Published on 26 Feb 2016 - 1:33

score 215 · Answer 14 · 2016-02-28 02:53:37

215

Views

Recursive Sum of Previous Term and its Inverse

Published on 28 Feb 2016 - 2:53

score 1.5k · Answer 15 · 2016-03-02 00:44:04

1.5k

Views

Express as a recurrence relation the number of ternary strings of length n that contain either 2 consecutive 0's or 2 consecutive 2's.

Published on 02 Mar 2016 - 0:44

List Question

Mathematically, how does one find the value of the Ackermann function in terms of n for a given m?

Number of Hamilton paths in an extremely dense undirected simple graph

Give an upper bound for a function satisfying $f(n)=4f(n−1)+n$

Algorithm for equality of trees of restricted depth

Finding a solution to $\sum _{n=1}^{n=k} \frac{1}{n^x}+\sum _{n=1}^{n=k} \frac{1}{n^y}=0$

Is the definition of recursive function unchanged if we restrict substitution to binary composition?

How do you go about solving this recurrence?

Infinite series, continued fractions, nested radicals and such - is there a general recursive algorithm theory?

Solve the recurrence using the Master Theorem: $T(n) = 5T\left(\frac{n}{4}\right) + n\lg \lg n$

Ackermann's Function

Is there a decimal based way to take roots or exponents?

Compare five ways of solving cubic equation by iterations (nested expressions)

How to solve recurrence $T(n) = T(n/3) + T(2n/3) +n$ using Master Theorem

Recursive Sum of Previous Term and its Inverse

Express as a recurrence relation the number of ternary strings of length n that contain either 2 consecutive 0's or 2 consecutive 2's.

Trending Questions

Popular # Hahtags

Popular Questions