Badge
| Editor | First edit. |
This badge has been awarded 884 times. Recently awarded to: |
may 22 at 7:16
Lower-bound complexities for finding common elements between two unsorted arrays
— Bakuriu
1135
may 21 at 17:27
Proving that the largest number of leaves in an $n$-ary tree of height $k$ is $k^n$
— Nik Bougalis
1684
may 20 at 1:05
Undecidability of whether a given TM halts or only has loops which can be detected by some TM
— Phillip Huff
62
may 19 at 22:35
Is the language of words containing equal number of 001 and 100 regular?
— Ben Elgar
312
may 19 at 6:15
how to prove this unsolvable problem about halting problem (turing machine) [duplicate]
— Alex
62
may 17 at 0:15
Shortest sub-sequence of one string, that's not a sub-sequence of another string
— Mike
405
may 16 at 6:20
Is “Find the shortest tour from a to z passing each node once in a directed graph” NP-complete?
— urzeit
233
may 15 at 16:34
Example of a non-context free language that nonetheless CAN be pumped?
— user2329564
233
may 14 at 13:32
(post deleted or otherwise unavailable)
— arm46
11
may 14 at 3:18
Show that it is undecidable if two Turing Machines accept the same language
— Quinn Culver
1213
may 11 at 16:02
What is the most efficient way to compute factorials modulo a prime?
— Thomas Ahle
1013
may 7 at 9:40
(post deleted or otherwise unavailable)
— Vroomfondel
11
may 6 at 9:23
Why don't we scale the cost of memory access when analyzing runtime of algorithms?
— Bryan Olivier
1685
may 5 at 4:20
How to distinguish whether a sample is from distribution $\chi_1$ or $\chi_2$?
— Richard
162
may 4 at 0:25
Without using pumping lemma, can we determine if $A =\{ww \mid w \in \{0,1\}^* \}$ is non regular?
— Peter
39615
may 3 at 22:24
Without using pumping lemma, can we determine if $A =\{ww \mid w \in \{0,1\}^* \}$ is non regular?
— Ilmari Karonen
1413
may 3 at 2:17
What type of formal notation is being used here to represent functional algorithms?
— David Kaczynski
1136
may 2 at 6:55
How is sound input and output data converted to use with machine learning networks?
— naxa
1063
apr 29 at 18:41
Prove that $L_1$ is regular if $L_2$, $L_1L_2$, $L_2L_1$ are regular
— Alejandro Sazo
34517
apr 29 at 16:26
Why is $\Theta$ notation suitable to insertion sort to describe its worst case running time?
— siddstuff
1284
apr 28 at 17:22
What does the posterior probability of a variable mean in the Bayes' rule?
— mruether
564
apr 27 at 22:37
Finding a tree that approximates the distances and total weights
— Fayez Abdlrazaq Deab
1327