Orchid XP v7 wrote:
> The Halting Problem states, loosely, that there is no algorithm that can 
> take an arbitrary computer program and decide [in finite time] whether 
> that program will run forever or come to a half after a finite time....
> 

After a significant degree of staring at this, I have reached the 
conclusion that the arrow can never be more than halfway there from 
here...  http://en.wikipedia.org/wiki/Arrow_of_time  ...

--Sherry Shaw


-- 
#macro T(E,N)sphere{x,.4rotate z*E*60translate y*N pigment{wrinkles scale
.3}finish{ambient 1}}#end#local I=0;#while(I<5)T(I,1)T(1-I,-1)#local I=I+
1;#end camera{location-5*z}plane{z,37 pigment{granite color_map{[.7rgb 0]
[1rgb 1]}}finish{ambient 2}}//                                   TenMoons

Post a reply to this message