Anonymous user
Talk:Execute a Markov algorithm: Difference between revisions
→Multiplication: new section
(→explicit vs tacit: response to C+) |
(→Multiplication: new section) |
||
Line 127:
NB. evaluations
markovDebug =: markovLexer@[ stringreplace^:a: ]</lang> ... which has since been replaced.
== Multiplication ==
To show the power of a Markov Algorithm engine, I've included a sample testcase that performs unary multiplication. If you can do this, you've got a good implementation. (I'm not sure if this indicates that such engines are [[wp:Turing completeness|turing complete]], but I suspect it does.) –[[User:Dkf|Donal Fellows]] 09:51, 17 December 2009 (UTC)
| |||