Notable Question - Badge - Computer Science Stack Exchange

Notable Question

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

Turing101

1,1701 gold badge12 silver badges30 bronze badges

earned this badge 6 times.

Time Complexity: Why does $n^n$ grow faster than $n!$?

Awarded Mar 18 at 10:16

Chinese room test vs Turing Test

Awarded Apr 2, 2022 at 17:35

What is the use of First() and Follow() in compiler design?

Awarded Mar 23, 2021 at 5:03

Which Grows Faster: Factorial or Double Exponentiation

Awarded Nov 26, 2019 at 22:40

Water Jug Problem in AI

Awarded Nov 12, 2019 at 0:25

Why are ambiguous grammars bad?

Awarded Jun 11, 2019 at 0:40

Others with this badge