Badge
| Teacher | Answered first question with score of 1 or more. |
This badge has been awarded 658 times. Recently awarded to: |
may 18 at 17:52
(post deleted or otherwise unavailable)
— systemovich
1011
may 14 at 2:52
Show that it is undecidable if two Turing Machines accept the same language
— Quinn Culver
1213
may 12 at 15:21
Performance differences between Go-Back-N and Selective Repeat ARQ protocols?
— inphi
261
may 8 at 12:20
Designing a regular expression for the set of all binary that contain strings without a particular sub string (i.e. $110$)
— ChesterX
484
may 6 at 10:58
Why don't we scale the cost of memory access when analyzing runtime of algorithms?
— Bryan Olivier
1685
may 3 at 20:18
Without using pumping lemma, can we determine if $A =\{ww \mid w \in \{0,1\}^* \}$ is non regular?
— Ilmari Karonen
1413
apr 29 at 18:36
Prove that $L_1$ is regular if $L_2$, $L_1L_2$, $L_2L_1$ are regular
— Alejandro Sazo
34517
apr 28 at 18:37
What does the posterior probability of a variable mean in the Bayes' rule?
— mruether
564
apr 27 at 23:42
Can all permutations of a set or string be generated in O(n log n) time?
— Fayez Abdlrazaq Deab
1327
apr 26 at 13:07
How to construct and write down a Turing machine for a given language?
— Matt Hintzke
1838
apr 21 at 16:50
Prove NP-completeness of deciding whether there is an edge-tour of at most a given length
— n.m.
1362
apr 21 at 10:17
How does the problem of having a coffee-machine close relate to vertex cover?
— cbra
705
apr 19 at 20:04
What is the relation between P vs. NP and Nature's ability to solve NP problems efficiently?
— dhj
263
apr 3 at 4:41
Are genetic algorithms special instances of random search done in an unexpectedly short run-time?
— nerorevenge
234
apr 2 at 14:47
Is every regular language Turing-decidable, and how can we prove this?
— Mandar Mitra
661