Question

How to solve this recurrence relation: $T(n) = 4\cdot T(\sqrt{n}) + n$

score 1.2k · Answer 1 · 2012-11-21 01:33:04

1.2k

Views

How to solve this recurrence relation: $T(n) = 4\cdot T(\sqrt{n}) + n$

Published on 21 Nov 2012 - 1:33

score 240 · Answer 2 · 2012-11-21 02:01:43

240

Views

Solving an equation in modular arithmetic

Published on 21 Nov 2012 - 2:01

score 355 · Answer 3 · 2026-03-31 20:54:07

355

Views

Is every context free language equivalent to one whose grammar has only one non-terminal symbol?

Published on 31 Mar 2026 - 20:54

score 790 · Answer 4 · 2012-11-26 11:36:23

790

Views

Is there a decidable theory in propositional logic whose consequences are not decidable?

Published on 26 Nov 2012 - 11:36

score 1.2k · Answer 5 · 2026-03-26 11:02:14

1.2k

Views

Is there any generalization of the hyperarithmetical hierarchy using the analytical hierarchy to formulas belonging to third-order logic and above?

Published on 26 Mar 2026 - 11:02

score 463 · Answer 6 · 2026-03-28 16:05:19

463

Views

I do not understand why the Turing computable sets of N are exactly the sets at level $\Delta_1^0$ of the arithmetical hierarchy

Published on 28 Mar 2026 - 16:05

score 768 · Answer 7 · 2026-03-28 17:39:33

768

Views

Question about computability of true/provable formulas

Published on 28 Mar 2026 - 17:39

score 241 · Answer 8 · 2026-03-28 17:39:35

241

Views

Question about $\Sigma_n$-soundness

Published on 28 Mar 2026 - 17:39

score 512 · Answer 9 · 2026-03-26 18:59:07

512

Views

question about Gödel numbering

Published on 26 Mar 2026 - 18:59

score 165 · Answer 10 · 2012-11-30 03:30:59

165

Views

unary recursive language

Published on 30 Nov 2012 - 3:30

score 46 · Answer 11 · 2026-03-25 14:23:45

46

Views

Is it really true that $K(x|y) = K(x,y) - K(y)$?

Published on 25 Mar 2026 - 14:23

score 827 · Answer 12 · 2012-12-02 03:10:58

827

Views

Reduction to prove that the function is not computable

Published on 02 Dec 2012 - 3:10

score 1.1k · Answer 13 · 2012-12-04 14:21:20

1.1k

Views

The symmetric difference of two recursive (recursively enumerable) sets is recursive (recursively enumerable)

Published on 04 Dec 2012 - 14:21

score 545 · Answer 14 · 2026-03-29 11:44:22

545

Views

The set of Turing machines that recognize $\{00, 01\}$ is undecidable

Published on 29 Mar 2026 - 11:44

score 675 · Answer 15 · 2012-12-09 00:30:13

675

Views

How to show if a function is partial recursive?

Published on 09 Dec 2012 - 0:30

List Question

How to solve this recurrence relation: $T(n) = 4\cdot T(\sqrt{n}) + n$

Solving an equation in modular arithmetic

Is every context free language equivalent to one whose grammar has only one non-terminal symbol?

Is there a decidable theory in propositional logic whose consequences are not decidable?

Is there any generalization of the hyperarithmetical hierarchy using the analytical hierarchy to formulas belonging to third-order logic and above?

I do not understand why the Turing computable sets of N are exactly the sets at level $\Delta_1^0$ of the arithmetical hierarchy

Question about computability of true/provable formulas

Question about $\Sigma_n$-soundness

question about Gödel numbering

unary recursive language

Is it really true that $K(x|y) = K(x,y) - K(y)$?

Reduction to prove that the function is not computable

The symmetric difference of two recursive (recursively enumerable) sets is recursive (recursively enumerable)

The set of Turing machines that recognize $\{00, 01\}$ is undecidable

How to show if a function is partial recursive?

Trending Questions

Popular # Hahtags

Popular Questions