3 ms·
I can still hear "whoosh" in my own ears here 8) Given how simple a Turing Machine can be, I seriously doubt (without any proof) that coq is not able to recrea
by gerdesj 9y ago
I can still hear "whoosh" in my own ears here 8)
Given how simple a Turing Machine can be, I seriously doubt (without any proof) that coq is not able to recreate a TM.
I am not an expert but the explanation about Turing Machines I read was in GED and involved a simple tape and a slack handful of symbols and operations and some basic hand waving. If coq can't manage that then it is unlikely to be useful - which I doubt.
- madsbuch 9y agoYou should check you ears. Coq only accepts well funded recursion. Non-bound Turing machines span a bigger complexity class. In other words: Turing machines can loop forever, Coq can not express programs that can do so. Read your CS 101: