←

A programming language is “Turing Complete” if it’s able to potentially execute any program, even if it would take infinite memory and time. Blueberry Danish Completeness is a similar test for theories of everything. Can Gum Theory, using the constraints | by Buster Benson

→

Back to photostream

Buster Benson

A programming language is “Turing Complete” if it’s able to potentially execute any program, even if it would take infinite memory and time. Blueberry Danish Completeness is a similar test for theories of everything. Can Gum Theory, using the constraints

ift.tt/2nDp6qu

454 views

0 faves

0 comments

Uploaded on February 2, 2018