Talk:Tip

Computational class

You probably know this, but your computational class proof would be total overkill if you weren't supporting the decimal fixed-point variation. Otherwise, simply note that Tip programs include all Collatz functions that arise from conversion of Fractran programs. --Ørjan (talk) 20:29, 12 July 2018 (UTC)

I missed that for some reason, although it's obvious once pointed out. (The ridiculous thing is that I got very close to recreating the Fractran TC proof, but settled on this approach instead, both because it worked in fixed-point and because it's way more efficient in terms of the length of the resulting program, although probably not in terms of runtime. I guess one goal of my current esolang research is trying to find the language that has the shortest implementation in a tarpit. Currently leaning towards Brainpocalypse but I suspect there's a better language out there that hasn't been discovered yet.) --ais523 21:15, 12 July 2018 (UTC)

Reification

I propose the following system:

• The initial IP value is put on the first line (if missing, then it's user input)
• The multipliers go on the second line (or the first, if the initial IP value is omitted). These are 0-indexed and seperated by whitespace, commas, or both
• Slashes are used to do rational numbers (e.g. 1/4 for 0.25). If one side of the fraction is omitted, it's assumed to be 1 (e.g. /4 is 0.25, 4/ is 4, & / is 1)
• Noninteger IP values are floored when choosing what multipier to pick (e.g. if the IP is 0.9, the 0th one is chosen)
• IP values are outputted
• If the IP equals 0, the program halts

CreeperBomb (interact in such a way to use diction in order to achieve the result of conversation or other form of communicating an idea or group of ideas between individuals including myself) 00:59, 9 May 2025 (UTC)