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-05-10 16:05:46

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 10 May 2026 - 16:05

score 117 · Answer 2 · 2026-04-10 13:11:37

117

Views

Why sup is needed for asymptotic notation definition?

Published on 10 Apr 2026 - 13:11

score 1.4k · Answer 3 · 2026-04-17 13:37:46

1.4k

Views

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

Published on 17 Apr 2026 - 13:37

score 66 · Answer 4 · 2026-04-16 06:08:31

66

Views

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

Published on 16 Apr 2026 - 6:08

score 464 · Answer 5 · 2026-04-16 10:12:20

464

Views

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

Published on 16 Apr 2026 - 10:12

score 306 · Answer 6 · 2026-04-10 10:06:53

306

Views

Barnes Hut algorithm performance and error bounds

Published on 10 Apr 2026 - 10:06

score 84 · Answer 7 · 2026-04-14 11:00:30

84

Views

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

Published on 14 Apr 2026 - 11:00

score 156 · Answer 8 · 2026-04-11 06:02:15

156

Views

Proof complexity cramers theorem

Published on 11 Apr 2026 - 6:02

score 144 · Answer 9 · 2026-05-04 03:55:51

144

Views

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

Published on 04 May 2026 - 3:55

score 30 · Answer 10 · 2026-05-10 16:07:06

30

Views

Finding the impulse reponse efficiently

Published on 10 May 2026 - 16:07

score 98 · Answer 11 · 2026-05-10 12:32:04

98

Views

Rainer Schuler's algorithm of CNF SAT problem

Published on 10 May 2026 - 12:32

score 413 · Answer 12 · 2026-04-10 07:01:31

413

Views

NP problems verification phase

Published on 10 Apr 2026 - 7:01

score 488 · Answer 13 · 2026-04-12 21:56:08

488

Views

How to compute commutator subgroup efficiently?

Published on 12 Apr 2026 - 21:56

score 438 · Answer 14 · 2026-04-12 11:22:42

438

Views

Subset sum with multiple lists

Published on 12 Apr 2026 - 11:22

score 166 · Answer 15 · 2026-04-11 16:24:53

166

Views

Königsberg bridge problem complexity estimate

Published on 11 Apr 2026 - 16:24

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