Epstein Secrets

on reduces to determinacy and randomness (i.e., programmable). I think it may have come up in the Krauss discussion. I also discussed it again in my Dewey lectures in the J. of Philosophy in December 2013. I don't frankly see how the Schrodinger analogy helps in this case. To clarify, the people I men

as he suggests, some results would follow from studying these topics in the framework he develops, but as always, that has to be shown. For example, Eilenberg's category-theoretic reanalysis of work on finite automata that I and others had done, including very good and respected mathematician's like Schut

on red=ces to determinacy and randomness (i.e., programmable). I think it m=y have come up in the Krauss discussion. I also discussed it again in my Dewey lectures in the J. of Philosophy in December 2013. I don't frankly see how the S=hrodinger analogy helps in this case. To clarify, the people I men

as he suggests, some=results would follow from studying these topics in the framework he develo=s, but as always, that has to be shown. For example, Eilenberg's category-theoretic reanalysis of wo=k on finite automata that I and others had done, including very good and r=spected mathematician's like Schut

on reduces to determinacy and randomness (i.e., programmable). I think it may have come up in the Krauss discussion. I also discussed it again in my Dewey lectures in the J. of Philosophy in December 2013. I don't frankly see how the Schrodinger analogy helps in this case. To clarify, the people I men

as he suggests, some results would follow from studying these topics in the framework he develops, but as always, that has to be shown. For example, Eilenberg's category-theoretic reanalysis of work on finite automata that I and others had done, including very good and respected mathematician's like Schut