Re: Binary addition for Turing Machine simulator
Mark Jason Dominus <[email protected]>
| Newsgroups | gmane.comp.lang.perl.qotw.discuss |
|---|---|
| Message-ID | <[email protected]> |
On Sep 15, 2004, at 4:49 PM, Jerrad Pierce wrote: > Another manner of tackling multiplication is layed out here > > http://perlmonks.org/?node_id=149032 That's the obvious way to proceed, because that's very similar to the way computers do base-2 multiplication internally anyway. But writing a base-1 multiplication program (that is "111_1111" -> "111111111111") for a TM is much easier, although less cool.