Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

8
  • 12
    \$\begingroup\$ Talk about right tool for the job.. \$\endgroup\$ Commented May 5, 2017 at 7:02
  • 28
    \$\begingroup\$ "Don't upvote trivial solutions that only uses a simple builtin." Well, in this case: Knowing that there's a language "Fractran" that has a single builtin that solves this specific task is by itself impressive. \$\endgroup\$ Commented May 5, 2017 at 8:51
  • 1
    \$\begingroup\$ @Pandya: Some Fractran implementations use prime factorization internally (as an optimization), but they don't have to; the language operates on factors, not prime factors. (It just happens that 2 and 3 are prime.) \$\endgroup\$ Commented May 5, 2017 at 12:23
  • 3
    \$\begingroup\$ Related SO code golf (pre-PPCG): Write a Fractran interpreter. \$\endgroup\$ Commented May 8, 2017 at 5:29
  • 3
    \$\begingroup\$ @AnderBiguri It looks like it came out of his studies of the Collatz conjecture; he proved that a generalization of Collatz is equivalent to Fractran and that Fractran is Turing-complete, therefore generalized Collatz is undecidable. \$\endgroup\$ Commented May 8, 2017 at 18:00