On 28 December 2013 17:31, Stephen Paul King <[email protected]>wrote:
> Hi Jason, > > On Fri, Dec 27, 2013 at 11:23 PM, Jason Resch <[email protected]>wrote: > >> On Fri, Dec 27, 2013 at 11:09 PM, Stephen Paul King < >> [email protected]> wrote: >> >>> Hi Jason, >>> >>> "It is not a question of whether or not that binary string refers to >>> anything that is true or not, only what its particular value happens to >>> be." No no no! We can not make statements without showing how their >>> proof are accessible! >>> >>> >> The proof is straight forward. Run the UD and see what the state is. >> > > Run it, on what hardware? ?? > Anything that emulates a Turing machine to sufficient accuracy (i.e. can expand its tape as necessary). -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/groups/opt_out.
