A random string can be in any base, not just binary. A string in base B is random if knowing all but one symbol doesn't help you guess the remaining symbol with probability higher than 1/B. You can guess by finding the shortest program that outputs the string for each of B choices and take the shortest of those. If the string is random then those B programs, when converted to base B, will be about the same length as the string.
A string may be random or not depending on which programming language you use. For long strings it doesn't matter much. On Tue, Nov 23, 2021, 6:31 PM Jim Bromer <[email protected]> wrote: > Since you have to have some kind of ordering (or system of orderings) to > define random within, I believe you are going to find that random is > somewhat problematic. For example, you might talk about a range for the > value of randomness. Why should randomness be binary? But while this seems > like it might be more sophisticated, and in my opinion, it makes more > sense, it also leads to complications. > *Artificial General Intelligence List <https://agi.topicbox.com/latest>* > / AGI / see discussions <https://agi.topicbox.com/groups/agi> + > participants <https://agi.topicbox.com/groups/agi/members> + > delivery options <https://agi.topicbox.com/groups/agi/subscription> > Permalink > <https://agi.topicbox.com/groups/agi/T5ff6237e11d945fb-Mf04d9fd3f3dbf7e07fd1f1c8> > ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T682f141cc89b5183-Mf9dccdfdc3f25a91abc2b63f Delivery options: https://agi.topicbox.com/groups/agi/subscription
