



Be the first pioneers to continue the Astronomy Discussions at our new Astronomy meeting place... The Space and Astronomy Agora 
To Be More Exact
Forum List  Follow Ups  Post Message  Back to Thread Topics  In Response To Posted by Tarvo on November 15, 2003 15:14:51 UTC 
Any state machine like computer what implements continuous process needs a loop (like a loop in algorithm) in Gödel's formal system because such state machine cannot be implemented as a function of time or by calculating just one state. Most changing structures can only be implemented in the computer, equations cannot model them other than iterative equations what implement computer or similar state machine. It is that for saying anything it's necessary to partly refute the Gödel's theorem, in spite that the argument of noncomputability is obviously wrong considering a huge number of programs written in so many years, and not yet anybody didn't find a single case when something couldn't be programmed because of noncomputability. But I still think that Gödel's theorem is useful to show the limits of (noniterative) equations.


Additional Information 

About Astronomy Net  Advertise on Astronomy Net  Contact & Comments  Privacy Policy 
Unless otherwise specified, web site content Copyright 19942021 John Huggins All Rights Reserved Forum posts are Copyright their authors as specified in the heading above the post. "dbHTML," "AstroGuide," "ASTRONOMY.NET" & "VA.NET" are trademarks of John Huggins 