Epstein Secrets

ne =unctions that add and remove sets from each other, and as a result, you =ight up with some periodic fluctuation, but not with an illegal state. Intuitionist math fits together with automata theory. It turns out that =here is a universal computer, i.e. a function that can itself compute =11 computable fun

h Turing thesis =ays that all universal computers can compute each other, and therefore =ave the same power. I suspect that it is possible that the Church Turing thesis is also a =hysical law, i.e. it is impossible to build physical computer that can =alculate more than a Turing machine. However, that conflic

ne functions that add and =emove sets from each other, and as a result, you might up with some period=c fluctuation, but not with an illegal state. Intuitionist math fits together with automata theory. It turns out that the=e is a universal computer, i.e. a function that can itself compute all com=utable fun

h Turing thesis says that all univers=l computers can compute each other, and therefore have the same power. I suspect that it is possible that the Church Turing thesis is also a physi=al law, i.e. it is impossible to build physical computer that can calculat= more than a Turing machine. However, that conflic

ne functions that add and =emove sets from each other, and as a result, you might up with some period=c fluctuation, but not with an illegal state. Intuitionist math fits together with automata theory. It turns out that the=e is a universal computer, i.e. a function that can itself compute all com=utable fun

h Turing thesis says that all univers=l computers can compute each other, and therefore have the same power. I suspect that it is possible that the Church Turing thesis is also a physi=al law, i.e. it is impossible to build physical computer that can calculat= more than a Turing machine. However, that conflic

ne functions that add and =emove sets from each other, and as a result, you might up with some period=c fluctuation, but not with an illegal state. Intuitionist math fits together with automata theory. It turns out that the=e is a universal computer, i.e. a function that can itself compute all com=utable fun

h Turing thesis says that all univers=l computers can compute each other, and therefore have the same power. I suspect that it is possible that the Church Turing thesis is also a physi=al law, i.e. it is impossible to build physical computer that can calculat= more than a Turing machine. However, that conflic