User sepp2k - Computer Science Stack Exchange

sepp2k

Member for 11 years, 9 months
Last seen more than a month ago

GitHub
Lübeck, Germany

12 Answers

Score Activity Newest

28 votes

Are there minimum criteria for a programming language being Turing complete?

answered Apr 2, 2012 at 13:57

26 votes

Algorithm to solve Turing's "Halting problem‍"

answered Dec 8, 2011 at 18:08

17 votes

Graph searching: Breadth-first vs. depth-first

answered Mar 13, 2012 at 10:57

12 votes

Accepted

Implementing the GSAT algorithm - How to select which literal to flip?

answered Mar 11, 2012 at 16:24

10 votes

All NP problems reduce to NP-complete problems: so how can NP problems not be NP-complete?

answered Apr 27, 2012 at 12:24

10 votes

Accepted

Lambda Calculus Evaluation

answered Apr 3, 2012 at 22:02

8 votes

Accepted

Confluence proof for a simple rewriting system

answered Apr 5, 2012 at 19:08

7 votes

Accepted

Regular Expression for the language that requires one symbol to occur at least once

answered Apr 4, 2012 at 1:58

5 votes

Regular sets have linear growth?

answered Apr 3, 2012 at 17:56

5 votes

A DFA for recognizing comments

answered Mar 14, 2012 at 22:55

5 votes

What is the significance of context-sensitive (Type 1) languages?

answered Mar 6, 2012 at 21:11

3 votes

Subset-sum and 3SAT

answered Apr 7, 2012 at 21:35