AKA Master Patata. Full name is Farooq Karimi Zadeh

Website: https://far.chickenkiller.com/ Persian website: https://blogfa.farooqkz.com/ Mastodon: https://mastodon.bsd.cafe/@farooqkz Persian Bitcoin Cash: https://persianbitcoincash.com/

  • 7 Posts
  • 9 Comments
Joined 1 year ago
cake
Cake day: September 9th, 2025

help-circle












  • 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.



  • I personally think both pro LLM and anti LLM are wrong. One group think they are gods. The other think they are demons. LLMs can be useful for programming to some extent. But they will create a disaster if you don’t know what are you doing. I have recently published a post about the matter on me blog. I think the best part is:

    I strongly believe that LLMs are useful for programming to some extent. Imagine you have a shop and you get a robot to do the moves for you. So you instead focus on the main business concerns.

    So if you want to make some changes to the code which don’t require intelligence, that is they are just mechanical tasks, LLMs are good. If you want the LLMs to understand semantics of your code, you have chosen the wrong tool. Maybe in future we’ll have new AI software and tools which also understand semantics to some extent. But I highly doubt a transformer will be able to do it. They just predict the next likely token.

    There is something I haven’t yet added to the post. So I am writing it here. Our computers are Universal Turing Machines. There are some fundamental limits to what a turing machine can’t do. Those are called undecidable problems. For instance a turing machine can never check if two pieces of code are semantically equivalent[1]. But that’s what human programmers can do. That’s why I emphasize on tasks which require no intelligence.

    [1] That’s about the general case. Sure there are exceptions. But as we say “exception is not the rule”.