Replies

I'm sorry for the correction... but many algorithms can be represented as turing machines, including the ones you discuss... it's a theory in computer science that all "computable" problems can, if you're masochistic enough to break it down into its essences, be solved with lambda calculus and turing machines (the same thing, actually). A turing machine does hypothetically store and re-use information...

However, that does not negate your excellent argument about how principles in math/computer science/logic can apply to natural laws. And, certainly, it can be an argument in favor of intelligent design. :-)

Thank you oh so very much for the information about Turing machines and for the kind words!

I certainly agree with your assertion that any computable problem can be converted to a Turing machine!

My hypothesis asserts that an algorithm (as defined above) cannot arise from null.

Hugs!