Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
bfe [2016/04/05 19:52] zashi [Framework] |
bfe [2016/11/08 17:21] zashi [Brainfuck] |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| - | <html> | ||
| - | <a href="https://scontent-atl3-1.xx.fbcdn.net/hphotos-xpa1/v/t1.0-9/11216567_10203633998770577_6143067410198800947_n.jpg?oh=96f6ae5cee070c0d138ef6a372e97d85&oe=56A0FE0F"><img src="https://scontent-atl3-1.xx.fbcdn.net/hphotos-xpa1/v/t1.0-9/11216567_10203633998770577_6143067410198800947_n.jpg?oh=96f6ae5cee070c0d138ef6a372e97d85&oe=56A0FE0F" width="100%"> | ||
| - | </a> | ||
| - | </html> | ||
| ====== Abstract ====== | ====== Abstract ====== | ||
| Line 22: | Line 18: | ||
| Programmatically, the read/write head is equivalent to a pointer and the sheet is simply a contiguous block of RAM. | Programmatically, the read/write head is equivalent to a pointer and the sheet is simply a contiguous block of RAM. | ||
| - | In many ways, BF is ideal to use as programmatic genes. Aside from being Turing-complete, which allows it to do anything that can be accomplished with any other programming language, strings of non-functional code can exist and be bypassed. With a single character (command) mutation that bypassed code path can become active, just like actual genetic code consisting of base-pairs. | + | In many ways, BF is ideal to use as programmatic genes. Aside from being Turing-complete, which allows it to do anything that can be accomplished with any other programming language, strings of non-functional code can exist and be bypassed. With a single character (command) mutation that bypassed code path can become active, just like actual genetic code consisting of codons. |
| ====== Specific Design Needs ====== | ====== Specific Design Needs ====== | ||
| Line 50: | Line 46: | ||
| ===== n-Depth Mean Compare ===== | ===== n-Depth Mean Compare ===== | ||
| - | Perhaps the greatest challenge in putting BFE together was determining how to score strands. [[:n-Depth_Mean_Compare|n-Depth Mean Compare]] (NMC) compares one ordered set of bytes to another of potentially differing length. NMC returns a floating point greater than 0. The closer to zero, the more similar the sets are. A score of zero means the sets are identical. | + | Perhaps the greatest challenge in putting BFE together was determining how to score strands. [[:n-Depth_Mean_Compare|n-Depth Mean Compare]] (NMC) compares one ordered set of bytes to another of potentially differing length. NMC returns a floating point greater than or equal to 0. The closer to zero, the more similar the sets are. A score of zero means the sets are identical. |
| In function and practice, NMC is similar to calculating [[https://en.wikipedia.org/wiki/Jaccard_index|Jaccard distance]], but also takes into account how far removed the set of bytes are from one another, not just how many bytes are common between the two. To clarify, NMC does not just calculate how similar one set is to another. The lower the n-Depth Mean Compare score, the fewer steps are needed to transform one set to the other. | In function and practice, NMC is similar to calculating [[https://en.wikipedia.org/wiki/Jaccard_index|Jaccard distance]], but also takes into account how far removed the set of bytes are from one another, not just how many bytes are common between the two. To clarify, NMC does not just calculate how similar one set is to another. The lower the n-Depth Mean Compare score, the fewer steps are needed to transform one set to the other. | ||
