3 files changed, 4 insertions, 4 deletions
@@ -31,7 +31,7 @@ class TupleSpace
 def initialize
 @que = {}
 @waiting = {}
- @que.taint # enable tainted comunication
 @waiting.taint
 self.taint
 end
@@ -20,7 +20,7 @@ The algorithm is the obvious loop "32.upto(126){|x| putc x}".
 It is not so hard to transform it to use each character *at most once*. The only slight difficulty comes from the constraint that we cannot "declare and then use" variables, because then the code will contain the variable name twice. This restriction is worked around by the $. global variable, the best friend of Ruby golfers.
-The relatively interesting part is to use all the charcters *at least once*. Of course, this is easily accomplished by putting everything into a comment (i.e., #unused...) or to a string literal (%(unused...), note that normal string literals are forbidden since they use quotation marks twice). Hey, but that's not fun at all! I tried to minimize the escapeway.
 * "@THEqQUICKbBROWNfFXjJMPSvVLAZYDGgkyz". Trash box of unused alphabet. I wish I could have used "gkyz" somewhere else.
@@ -199,6 +199,6 @@ succeed to return 0. The meaning of ``\1nn`` in regular expression
 seems to depend on the existence of capturing expressions.
 In spite of these Ruby's behaviors, we have a good news! The present
-SAT sover does not suffer from the issues because the program cannot
 return solutions in practical time for inputs with variables more than
-40. \ No newline at end of file