We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Talk:Hollang
Jump to navigation
Jump to search
Could you clarify "holographically embed them into variables"? How does averaging two bitstrings work, some operation between an and and an or?--Zerk (talk) 19:21, 17 April 2014 (EDT)
- Averaging them works by literally averaging the zeros and ones at each position, and then for each bit rounding it to either 0 or 1 stochastically (so if the average for that bit is closer to 0 it will be rounded to zero more often). This makes it so that the average resembles all the components. The link on my homepage has the paper that I got all this information from.
- --Doesthiswork (talk) 22:11, 17 April 2014 (EDT)
- No, it averages all the terms in the brackets before dithering the average to 0 and 1
- --Doesthiswork (talk) 00:07, 18 April 2014 (EDT)
- Ooh, the paper mentions permutations as a non self-inverse transformation, any plans to add those? It'd definitely solve your add:3:3 = add:1:1 = 2a -> 2 issue.
- --Zerk (talk) 01:06, 19 April 2014 (EDT)