FRACTRAN. Given 2^x return 3^(x^3).
https://chatgpt.com/share/6ad58a36-5278-83ea-b1f5-22534915e1...
I entered two prompts to it:
Describe the language FRACTRAN.
Write a FRACTRAN program that takes 2^x and finishes with the value of in the 3^y of y = x^3.
4 (2^2) -> 6561 (3^8). Other values may be in other power registers.
And it did https://chatgpt.com/share/6ad58a36-5278-83ea-b1f5-22534915e1...The program that it came up with was:
38/17 1495/38 29/19 19/23 62/377 37/29 29/31 41/185 89/37 3913/82 47/41 41/43 106/611 59/47 47/53 61/413 37/59 9581/122 71/61 61/67 146/923 79/71 71/73 249/869 59/79 79/83 97/178 1/89 89/97 17/2
You can paste that into https://tjwei.github.io/Fractran/ and run it. Put the input of 2^3 and I recommend a 1000x speedup. It's output was 3^27
---
One can certainly go adversarial with their tasks... though I know junior programmers that fall apart on things they can't look up on Stack Overflow either.
For tasks that I've worked with it on, I've been reasonably impressed by it. Though I'll also note that a lot of the work that we do isn't new.
There are register machines out there. When I search google for "register machine cube of number" it comes up with one. The question of how do you apply the register machine model for that (if you're claiming that is in its training data rather than searching for it like I did) and then compile that into FRACTRAN is about chaining together tools reasonably... it appears to have written a compiler in Python for a model register machine to FRACTRAN.
Lets ask a different question... if I gave you the task of writing that program in FRACTRAN, would you attempt to solve it in the same way?