this post was submitted on 09 Feb 2025
5 points (77.8% liked)

Programming

264 readers
2 users here now

Welcome to the Lemmygrad programming community! This is a space where programmers of all levels can discuss programming, ask for help with problems, and share their personal programming projects with others.


Rules

  1. Respect all users, regardless of their level of knowledge in programming. We're here to learn and help each other improve.
  2. Keep posts relevant to programming and related topics.
  3. Respect people's personal preferences. If you disagree with someone's choice of programming language, method of formatting code, or anything else, don't attack the poster. Genuine criticism is fine, but personal attacks are not.
  4. In order to promote breaks from typing, all code snippets must be photos of code written on paper.
    Just kidding :), please use proper markdown code blocks.

founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
[–] Collatz_problem@hexbear.net 3 points 1 month ago* (last edited 1 month ago)

If we define "the simplest solution" as "the solution with the shortest program computing it", then this problem is literally uncomputable, because it is equivalent to the halting problem. Moreover, it is proven that there is no algorithm that can in general case achieve results meaningfully better than "print the number from the lookup table".