Question

In computing $2^{10}\approx10^3$ so what is $10$ approximately equal to?

score 40 · Answer 1 · 2026-03-30 23:56:48

40

Views

In computing $2^{10}\approx10^3$ so what is $10$ approximately equal to?

Published on 30 Mar 2026 - 23:56

score 510 · Answer 2 · 2026-03-25 17:39:43

510

Views

Once a mathematical theorem is proven true like the Halting problem can it ever be disproven?

Published on 25 Mar 2026 - 17:39

score 561 · Answer 3 · 2020-01-18 18:32:28

561

Views

Countable vs Recursively Enumerable Sets

Published on 18 Jan 2020 - 18:32

score 55 · Answer 4 · 2026-03-30 13:11:16

55

Views

Inclusion of computational complexity classes

Published on 30 Mar 2026 - 13:11

score 57 · Answer 5 · 2026-03-31 07:52:59

57

Views

Reduce the boolean equation to simplest form. I have finished the problem, I just need help to verify if what I've done is correct.

Published on 31 Mar 2026 - 7:52

score 215 · Answer 6 · 2020-01-19 13:41:50

215

Views

Bellman - Ford algorithm in "Introduction to Algorithms 3rd Edition" by CLRS(Cormen, Leiserson, Rivest, Stein)

Published on 19 Jan 2020 - 13:41

score 256 · Answer 7 · 2026-04-01 01:56:21

256

Views

Converting NFAs to DFAs

Published on 01 Apr 2026 - 1:56

score 931 · Answer 8 · 2020-01-20 08:28:00

931

Views

Why graphs are so important

Published on 20 Jan 2020 - 8:28

score 69 · Answer 9 · 2020-01-20 11:42:07

69

Views

About the shortest-path estimates in “Introduction to Algorithms 3rd Edition” by CLRS(Cormen, Leiserson, Rivest, Stein).

Published on 20 Jan 2020 - 11:42

score 21 · Answer 10 · 2026-03-30 13:08:31

21

Views

What are the set of cosets of an induced graph?

Published on 30 Mar 2026 - 13:08

score 142 · Answer 11 · 2026-03-30 14:54:20

142

Views

Comparing Growth rates

Published on 30 Mar 2026 - 14:54

score 144 · Answer 12 · 2020-01-22 19:51:13

144

Views

$|V| = n$, and $|E| = n+k$, with exactly $k+1$ cycles, then the graph $G$ is connected

Published on 22 Jan 2020 - 19:51

score 173 · Answer 13 · 2026-03-28 10:16:18

173

Views

"If then" statements in a topos

Published on 28 Mar 2026 - 10:16

score 218 · Answer 14 · 2026-03-26 12:32:18

218

Views

Reduction from Graph Isomorphism to String Isomorphism

Published on 26 Mar 2026 - 12:32

score 2k · Answer 15 · 2026-03-26 09:16:45

2k

Views

Constructing Turing machine for $L=\{a^n b^m, m\%n=0\}$

Published on 26 Mar 2026 - 9:16

List Question

In computing $2^{10}\approx10^3$ so what is $10$ approximately equal to?

Once a mathematical theorem is proven true like the Halting problem can it ever be disproven?

Countable vs Recursively Enumerable Sets

Inclusion of computational complexity classes

Reduce the boolean equation to simplest form. I have finished the problem, I just need help to verify if what I've done is correct.

Bellman - Ford algorithm in "Introduction to Algorithms 3rd Edition" by CLRS(Cormen, Leiserson, Rivest, Stein)

Converting NFAs to DFAs

Why graphs are so important

About the shortest-path estimates in “Introduction to Algorithms 3rd Edition” by CLRS(Cormen, Leiserson, Rivest, Stein).

What are the set of cosets of an induced graph?

Comparing Growth rates

$|V| = n$, and $|E| = n+k$, with exactly $k+1$ cycles, then the graph $G$ is connected

"If then" statements in a topos

Reduction from Graph Isomorphism to String Isomorphism

Constructing Turing machine for $L=\{a^n b^m, m\%n=0\}$

Trending Questions

Popular # Hahtags

Popular Questions