Question

Show that single-tape TMs that cannot write on the portion of the tape containing the input string recognizes only regular languages.

score 2.2k · Answer 1 · 2026-03-25 06:10:50

2.2k

Views

Show that single-tape TMs that cannot write on the portion of the tape containing the input string recognizes only regular languages.

Published on 25 Mar 2026 - 6:10

score 114 · Answer 2 · 2018-03-11 23:56:36

114

Views

Why sup is needed for asymptotic notation definition?

Published on 11 Mar 2018 - 23:56

score 1.4k · Answer 3 · 2018-03-12 20:06:33

1.4k

Views

Complexity (prove or disprove): If $f(g(n))=O(n)$ and $f(n)=Ω(n)$ then $g(n)=O(n)$

Published on 12 Mar 2018 - 20:06

score 63 · Answer 4 · 2018-03-13 11:49:14

63

Views

Big $O$ prove $2n^2 = O(n^2)$ and $2n^2 + n^2m = O(n^2 m)$

Published on 13 Mar 2018 - 11:49

score 461 · Answer 5 · 2018-03-13 21:54:13

461

Views

Reference request: "Schoolbook long multiplication has complextity $O(n^2)$"

Published on 13 Mar 2018 - 21:54

score 303 · Answer 6 · 2018-03-14 16:56:59

303

Views

Barnes Hut algorithm performance and error bounds

Published on 14 Mar 2018 - 16:56

score 81 · Answer 7 · 2018-03-15 05:05:07

81

Views

Finding out how many time units will each algorithm spend for sorting an array of $1\,000\,000$ objects

Published on 15 Mar 2018 - 5:05

score 152 · Answer 8 · 2018-03-15 13:18:47

152

Views

Proof complexity cramers theorem

Published on 15 Mar 2018 - 13:18

score 137 · Answer 9 · 2026-03-22 21:32:28

137

Views

How many operations are required to check the congruence $(x+a)^n \equiv x^n + a \pmod{x^r-1, n}$?

Published on 22 Mar 2026 - 21:32

score 26 · Answer 10 · 2026-03-25 10:59:41

26

Views

Finding the impulse reponse efficiently

Published on 25 Mar 2026 - 10:59

score 92 · Answer 11 · 2026-03-25 02:59:23

92

Views

Rainer Schuler's algorithm of CNF SAT problem

Published on 25 Mar 2026 - 2:59

score 409 · Answer 12 · 2018-03-17 17:51:14

409

Views

NP problems verification phase

Published on 17 Mar 2018 - 17:51

score 485 · Answer 13 · 2018-03-18 13:33:39

485

Views

How to compute commutator subgroup efficiently?

Published on 18 Mar 2018 - 13:33

score 434 · Answer 14 · 2018-03-19 08:48:41

434

Views

Subset sum with multiple lists

Published on 19 Mar 2018 - 8:48

score 163 · Answer 15 · 2018-03-21 11:15:45

163

Views

Königsberg bridge problem complexity estimate

Published on 21 Mar 2018 - 11:15

List Question

Show that single-tape TMs that cannot write on the portion of the tape containing the input string recognizes only regular languages.

Why sup is needed for asymptotic notation definition?

Complexity (prove or disprove): If $f(g(n))=O(n)$ and $f(n)=Ω(n)$ then $g(n)=O(n)$

Big $O$ prove $2n^2 = O(n^2)$ and $2n^2 + n^2m = O(n^2 m)$

Reference request: "Schoolbook long multiplication has complextity $O(n^2)$"

Barnes Hut algorithm performance and error bounds

Finding out how many time units will each algorithm spend for sorting an array of $1\,000\,000$ objects

Proof complexity cramers theorem

How many operations are required to check the congruence $(x+a)^n \equiv x^n + a \pmod{x^r-1, n}$?

Finding the impulse reponse efficiently

Rainer Schuler's algorithm of CNF SAT problem

NP problems verification phase

How to compute commutator subgroup efficiently?

Subset sum with multiple lists

Königsberg bridge problem complexity estimate

Trending Questions

Popular # Hahtags

Popular Questions