A turing machine in 133 bytes of javascript

Re:A turing machine in 133 bytes of javascript by AndreasT on Monday November 28, 2011 @06:53AM (#3285508)

$ uglifyjs function tm(I,t,e,s,i,c,k) {i=0;while(s!=e){c=t[i];k=(c)?I[s][c]:I[s].B;if(!k)return false;t.splice(i,1,k.w);i+=k.m;s=k.n;}return t;} function tm(a,b,c,d,e,f,g){e=0;while(d!=c){f=b[e],g=f?a[d][f]:a[d].B;if(!g)return!1;b.splice(e,1,g.w),e+=g.m,d=g.n}return b}

[ Parent | on HN ]

Re:A turing machine in 133 bytes of javascript by Swizec on Monday November 28, 2011 @07:05AM (#3285534)

So it's two characters shorter?

I left the two ;} because my syntax highlighter was yelling at me that I'm doing something ugly and I was inside the 140B limit anyway.

[ Parent | on HN ]

Re:A turing machine in 133 bytes of javascript by darklajid on Monday November 28, 2011 @07:14AM (#3285549)

No, not just two.

It stripped the space before the first { and between the "return" and "false".

False is represented as !1.

"(c)?foo:bar" is replaced by "c?foo:bar". Plus - semicolons are removed as you noticed.

But - really.. It's ugly enough as it is :)

[ Parent | on HN ]

Re:A turing machine in 133 bytes of javascript by jedschmidt on Monday November 28, 2011 @09:19AM (#3285926)

I'm sure there's room left that the 140byt.es folks will find, but off the bat:

    e=0;while(d!=c)
    for(e=0;d!=c;)

[ Parent | on HN ]