4 ms·
I like the idea, but needing a conversion function that isn’t written in the language (on both input _and_ output), IMO, is a bit of a blemish. If, to add a an
by Someone 7y ago
I like the idea, but needing a conversion function that isn’t written in the language (on both input _and_ output), IMO, is a bit of a blemish.
If, to add a and b, one first has to compute 2^a 3^b, and afterwards, compute ³logx, how is that better than just using a+b as input, running the empty program, and looking at its output?
- vanderZwan 7y agoShouldn't both the conversion functions technically be implementable in Fractran as well though? Perhaps these were left as exercises for the reader ;)
- braythwayt 7y agoThis is the repo where I wrote my various implementations and experiments: https://github.com/raganwald/FRACTRAN/ https://github.com/raganwald/FRACTRAN/ One of the versions that didn't make it into the essay used this pipelining notation for combining a FRACTRAN program with the starting seed: 10 |> 3/11 847/45 143/6 7/3 10/91 3/7 36/325 1/2 36/5 I had some idea that this could evolve into writing different fractran programs to handle converting a seed in ordinary integer form into whatever the core function wanted, filtering the values of n as we do with PRIMEGAME, or picking the last value of n as we do with FIBGAME. Doubt anything will come of it, but anyhow, the original idea seems close to what you're suggesting. What would make the pipelining ida interesting, of course, would be compiling such notation to a single FRACTRAN program.
- braythwayt 7y agoWhat is it you think we're doing when we write `2+2`, if not encoding an expression using something called "ASCII?" FRACTRAN simply asks us to use a different encoding, "Prime Factorization." :-D That being said, you ask a really, REALLY interesting question. Why not write the conversion from ASCII (or anything else) to FRACTRAN as well as whatever function we're trying to compute? The answer, I suggest, lies in what we're using FRACTRAN for. Conversion to and from ASCII is what we might call "incidental complexity," it's useful to humans, but not at the core of whatever function (e.g. Fibonacci, digits of PI, prime numbers, universal FRACTRAN interpretation) we're studying. Were we to bake ASCII encoding in, the resulting FRACTRAN program would be 95% ASCII manipulation and only 5% fibonacci (or whatever). This highlights, of course, why non-esoteric languages have tools for modularization and abstraction. When we write "Hello, World," we rely on standard libraries and other tools that do the things our program isn't about.
- deleted 7y ago[deleted]