2,441 reputation
11437
bio website virtualtrebuchet.com
location Fort Worth, TX
age 19
visits member for 3 years, 5 months
seen 2 days ago

Jul
11
awarded  Notable Question
Jul
2
awarded  Curious
Jun
20
awarded  Notable Question
Jun
15
awarded  Nice Question
Jun
10
awarded  Nice Question
Jun
10
awarded  Popular Question
Jun
10
answered Print 123454321 without if statements and using only 2 variables
Jun
10
asked Convert a program to a palindromic program
May
14
awarded  Popular Question
Apr
3
comment Convert short month names to their longer counterparts [Ended]
Looks like normal Perl to me...
Mar
25
awarded  Pundit
Mar
20
awarded  Good Answer
Mar
19
comment So obviously, P = NP
@TimSeguine I admit that my use of the word "nondeterministic" in this context is dubious at best, just like the claim that SAT can be solved in polynomial time. I know it's not correct, it's just part of the game of deception.
Mar
18
awarded  Good Question
Mar
18
comment So obviously, P = NP
@Cruncher To be more precise, the larger the number of variables, the less likely it is to return the correct answer. (e.g. a very long expression with a single variable will almost always return the correct answer)
Mar
18
awarded  Nice Answer
Mar
18
awarded  Citizen Patrol
Mar
17
comment Complement a Regular Expression
I don't think that would make it much harder
Mar
17
comment Complement a Regular Expression
I'd suggest a simple grammar that can be described in a few lines. You could use the formal definition of a regular expression, which only uses concatenation (RS), alternation (R|S), and Kleene star (R*).
Mar
17
comment Complement a Regular Expression
I feel like this will be too hard unless you give a simpler regex grammar than POSIX ERE.