Help Center > Badges > Notable Question

Notable Question

Question with 2,500 views. This badge can be awarded multiple times.

Mr. Sigma.

1,1387 silver badges29 bronze badges

earned this badge 2 times.

How can Turing machines loop forever given that the input is finite?

Awarded Mar 29 at 0:05

Do any two spanning trees of a simple graph always have some common edges?

Awarded Dec 7 '18 at 11:05

Others with this badge

Computer Science Stack Exchange works best with JavaScript enabled