DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
comex wrote:
FOR*(lambda m:(lambda c:(lambda f:f(f,0,0,[0]*1000))(lambda
f,n,p,a:(('',a,n)) if p=len(c) else ((lambda dc:dc[c[p]]() if c[p] in
dc.keys() else
f(f,n,p+1,a))({43:lambda:f(f,n,p+1,a[:n]+[(a[n]+1)%256]+a[n+1:]),45:lambda:f(f,n,p+1,a[:n]+[(a[n]-1)%256]+a[n+1:]),62:lambda:f(f,n+1,p+1,a),60:lambda:f(f,n-1,p+1,a),46:lambda:(lambda
v:(chr(a[n])+v[0],v[1],v[2]))(f(f,n,p+1,a)),91:lambda:(f(f,n,((lambda
g:g(g,p+1,1)) (lambda f,n,p:n if p==0 else f(f,n+1,p+1) if c[n]==91
else f(f,n+1,p-1) if c[n]==93 else f(f,n+1,p))),a)) if a[n]==0 else
((lambda v:(lambda w:(v[0]+w[0],w[1],w[2]))(f(f,v[2],p,v[1])))
(f(f,n,p+1,a))),93:lambda:('',a,n)})))[0])([ord(i) for i in
m]))('+++.')
I ran this through Python 2.5:
import binascii
test = (lambda m: [etc.]
print binascii.b2a_hex(test)
and got 03 as the output. I will record it accordingly.
DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
comex wrote:
On Sun, Jul 27, 2008 at 11:24 PM, comex [EMAIL PROTECTED] wrote:
5667 O1 1.9 BobTHJ Some players are more equal than others
FOR*(lambda m:...
Since ehird insists that \x03 doesn't count...
I retract this vote and vote FOR*(lambda m:(lambda c:(lambda
f:f(f,0,0,[0]*1000))(lambda
f,n,p,a:(('',a,n)) if p=len(c) else ((lambda dc:dc[c[p]]() if c[p] in
dc.keys() else
f(f,n,p+1,a))({43:lambda:f(f,n,p+1,a[:n]+[(a[n]+1)%256]+a[n+1:]),45:lambda:f(f,n,p+1,a[:n]+[(a[n]-1)%256]+a[n+1:]),62:lambda:f(f,n+1,p+1,a),60:lambda:f(f,n-1,p+1,a),46:lambda:(lambda
v:(chr(a[n])+v[0],v[1],v[2]))(f(f,n,p+1,a)),91:lambda:(f(f,n,((lambda
g:g(g,p+1,1)) (lambda f,n,p:n if p==0 else f(f,n+1,p+1) if c[n]==91
else f(f,n+1,p-1) if c[n]==93 else f(f,n+1,p))),a)) if a[n]==0 else
((lambda v:(lambda w:(v[0]+w[0],w[1],w[2]))(f(f,v[2],p,v[1])))
(f(f,n,p+1,a))),93:lambda:('',a,n)})))[0])([ord(i) for i in
m]))('+++[-+++]++.')
This, when evaluated in Python 2.5, prints '3'.
And now I understand what '+++.' in the previous version was
getting at. Dear God, you should be taken out and shot. :)
Re: DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
2008/7/28 Ed Murphy [EMAIL PROTECTED]: Aha, I only have 2.2 (Zenith is still running RH9, and I still haven't gotten around to buying its successor). You can run it on rutian. :P Note that the expression evaluates to the string '\x03', but I guess maybe, since it's a single character, we can treat it as 3. tusho
Re: DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
tusho wrote: You can run it on rutian. :P What's that?
Re: DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
2008/7/28 Ed Murphy [EMAIL PROTECTED]: What's that? eso-std.org's server, so named when we (me and ais523) were bashing randomly-typed names off our keyboards over IRC, and we liked that one. After a quick google, turned out it's a species in both Star Trek *and* Star Wars. Which was all the more reason to name it that.
Re: DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
tusho wrote: 2008/7/28 Ed Murphy [EMAIL PROTECTED]: What's that? eso-std.org's server, so named when we (me and ais523) were bashing randomly-typed names off our keyboards over IRC, and we liked that one. After a quick google, turned out it's a species in both Star Trek *and* Star Wars. Which was all the more reason to name it that. Okay, give me a shell account?
Re: DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
On Sun, Jul 27, 2008 at 11:46 PM, Ed Murphy [EMAIL PROTECTED] wrote:
comex wrote:
5667 O1 1.9 BobTHJ Some players are more equal than others
FOR*(lambda m:(lambda c:(lambda f:f(f,0,0,[0]*1000))(lambda
f,n,p,a:(('',a,n)) if p=len(c) else ((lambda dc:dc[c[p]]() if c[p] in
dc.keys() else
f(f,n,p+1,a))({43:lambda:f(f,n,p+1,a[:n]+[(a[n]+1)%256]+a[n+1:]),45:lambda:f(f,n,p+1,a[:n]+[(a[n]-1)%256]+a[n+1:]),62:lambda:f(f,n+1,p+1,a),60:lambda:f(f,n-1,p+1,a),46:lambda:(lambda
v:(chr(a[n])+v[0],v[1],v[2]))(f(f,n,p+1,a)),91:lambda:(f(f,n,((lambda
g:g(g,p+1,1)) (lambda f,n,p:n if p==0 else f(f,n+1,p+1) if c[n]==91
else f(f,n+1,p-1) if c[n]==93 else f(f,n+1,p))),a)) if a[n]==0 else
((lambda v:(lambda w:(v[0]+w[0],w[1],w[2]))(f(f,v[2],p,v[1])))
(f(f,n,p+1,a))),93:lambda:('',a,n)})))[0])([ord(i) for i in
m]))('+++.')
I tried feeding this to Python, but it spat back a syntax error.
It requires Python 2.5 for the ternary operator ('a if b else c').
I was thinking of posting a reward for whoever figured out first what
the expression did-- without a sample argument, of course...
Re: DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
comex wrote:
On Sun, Jul 27, 2008 at 11:46 PM, Ed Murphy [EMAIL PROTECTED] wrote:
comex wrote:
5667 O1 1.9 BobTHJ Some players are more equal than others
FOR*(lambda m:(lambda c:(lambda f:f(f,0,0,[0]*1000))(lambda
f,n,p,a:(('',a,n)) if p=len(c) else ((lambda dc:dc[c[p]]() if c[p] in
dc.keys() else
f(f,n,p+1,a))({43:lambda:f(f,n,p+1,a[:n]+[(a[n]+1)%256]+a[n+1:]),45:lambda:f(f,n,p+1,a[:n]+[(a[n]-1)%256]+a[n+1:]),62:lambda:f(f,n+1,p+1,a),60:lambda:f(f,n-1,p+1,a),46:lambda:(lambda
v:(chr(a[n])+v[0],v[1],v[2]))(f(f,n,p+1,a)),91:lambda:(f(f,n,((lambda
g:g(g,p+1,1)) (lambda f,n,p:n if p==0 else f(f,n+1,p+1) if c[n]==91
else f(f,n+1,p-1) if c[n]==93 else f(f,n+1,p))),a)) if a[n]==0 else
((lambda v:(lambda w:(v[0]+w[0],w[1],w[2]))(f(f,v[2],p,v[1])))
(f(f,n,p+1,a))),93:lambda:('',a,n)})))[0])([ord(i) for i in
m]))('+++.')
I tried feeding this to Python, but it spat back a syntax error.
It requires Python 2.5 for the ternary operator ('a if b else c').
Aha, I only have 2.2 (Zenith is still running RH9, and I still haven't
gotten around to buying its successor).
DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
On Sat, Jul 26, 2008 at 11:36 AM, Zefram [EMAIL PROTECTED] wrote: I hereby vote: 5664 D2 3BobTHJ Chambers II AGAINST Anything about this in particular that I could change to get your vote? BobTHJ
Re: DIS: Re: BUS: Re: OFF: distribution of proposals 5658-5667
Roger Hicks wrote: Anything about this in particular that I could change to get your vote? I dislike the general concept of a profusion of chambers, so no. -zefram
