Farooq

  • 8 Posts
  • 41 Comments
Joined 10 months ago
cake
Cake day: September 9th, 2025

help-circle




  • Generating a working assembly code is not a big deal. People were doing it before LLMs see slightest light of the day using various other heuristics including Genetic Programming. The challenge is writing an Assembly code which you can prove works well and will continue to do so :)

    That’s why Genetic Programming is very rarely used to directly generate a software.

    Edit: But you can use GP for Machine Learning tasks. Tell it to generate a program, like an assembly code which plays chess well. Or can do a binary classification given a photo or other media.












  • Hey. The number of problems which can are decidable are infinite as are those which are not. But as soon as there is a backward jump in your code, a Turing machine most likely won’t be able to decide if it’ll halt or not. The while(true) is an exception. In the real world we have a great number of programs whose loops cannot be decided by a Turing machine. But the programmer who has written the code knows when the loop will terminate.

    If we see the machine code, if there is a conditional backward jump(unlike while(true) which is unconditional), in the general case it’s undecidable.