3rd Task: Difference between revisions

Line 1:

'''Principle of Computational Equivalence'''

Can simple programs produce very rich and complicated behaviors? Could it be possible that all of the amazing things we see in the universe be the result of a simple program? That would be very exciting to have a program that is an ultimate precise model of our universe. If you run it long enough it would produce complex models. Stephen Wolfram asks how would this program be like.

Revision as of 00:48, 8 December 2020 (view source) Fzayguler (talk \| contribs) No edit summary ← Older edit		Revision as of 00:48, 8 December 2020 (view source) Fzayguler (talk \| contribs) No edit summary Newer edit →
Line 1:		Line 1:

	'''Principle of Computational Equivalence'''		'''Principle of Computational Equivalence'''


	Can simple programs produce very rich and complicated behaviors? Could it be possible that all of the amazing things we see in the universe be the result of a simple program? That would be very exciting to have a program that is an ultimate precise model of our universe. If you run it long enough it would produce complex models. Stephen Wolfram asks how would this program be like.		Can simple programs produce very rich and complicated behaviors? Could it be possible that all of the amazing things we see in the universe be the result of a simple program? That would be very exciting to have a program that is an ultimate precise model of our universe. If you run it long enough it would produce complex models. Stephen Wolfram asks how would this program be like.