Computer Science
StudentsTea
  • Member for 7 years, 1 month
Profile Activity
Stats
310
reputation
3k
reached
2
answers
7
questions
About

delete me

Communities (21)

Top network posts

This user doesn’t have any gold badges yet.
1
silver badge
11
bronze badges
View all badges

Top tags (17)

Score 4
Posts 2
Posts % 22
Score 4
Posts 2
Score 1
Posts 2
Score 1
Posts 2
Score 1
Posts 2
Score 1
Posts 2
View all tags →

Top posts (9)

All Questions Answers
Votes Newest
7 How is Turing's Solution to the Halting Problem Not Simply "Failure By Design"? Aug 27 '14
4 How is Turing's Solution to the Halting Problem Not Simply "Failure By Design"? Aug 27 '14
2 Is P the set of all algorithms whose run-time is $O\left( n^{ O \left( 1 \right) }\right)$? Apr 19 '17
2 Insertions in Red-Black Trees Mar 28 '17
1 Is this Summary of Asymptotic Analysis Correct? Jan 13 '17
1 Why is it that any graph traversal method can be described as pre-order, in-order, or post-order? What do those terms mean? Feb 10 '17
0 Using Pascal's Triangle to implement queues and stacks using heaps Sep 27 '17
0 The defining property of problems in NP [duplicate] Apr 20 '17
0 Why is it that any graph traversal method can be described as pre-order, in-order, or post-order? What do those terms mean? Feb 10 '17

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.