Re:Gödel's Incompleteness Theorem in Bash
by knome on Friday February 25, 2022 @06:21AM
(#30466082)
The prime factorization ensures that every combination of terms creates a unique value. How does binary do so?
[ Parent
| on HN ]
Re:Gödel's Incompleteness Theorem in Bash
by Strilanc on Friday February 25, 2022 @06:57AM
(#30466326)
Typically either with length prefixing (what binary protocols do) or with escaping/quoting (what text protocols do). For example, JSON assigns a unique bit sequence to every possible list of strings by using '"' and ',' as separators and '\' as an escape signal to disable the special meaning of the next character.