arc/notes
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

vault backup: 2025-05-09 12:37:48

Browse Source
This commit is contained in:
arc 2025-05-09 12:37:48 -06:00
parent 9efb23dc3d
commit 053eea8b11
1 changed files with 3 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
notes/ANS Theory.md
View File

@ -44,3 +44,6 @@ The decoding process performs the same series of steps, but by asking a question
1. Is the value between $0.00$ and $0.50$? If so, the first coin flip resulted in *Tails*. Otherwise if the value is between $0.50$ and $1.00$, the first coin flip resulted in *Heads*. 1. Is the value between $0.00$ and $0.50$? If so, the first coin flip resulted in *Tails*. Otherwise if the value is between $0.50$ and $1.00$, the first coin flip resulted in *Heads*.
The above process can be repeated just like the encoding process until we've determined the result of the first three coin flips. The above process can be repeated just like the encoding process until we've determined the result of the first three coin flips.
These subdivisions can be encoded using $0$ and $1$, where $0$ represents the bottom half of the range, and $1$ represents the top half of the range.
When the alphabet is large enough that you can't select a particular outcome using one bit, multiple bits can be used instead to divide up and down the range.