The latest articles on Forem by dam-ari (@damari). https://forem.com/damari https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1208215%2Fe4417ab8-17ec-4a31-a1ed-4bdf9659fad1.jpeg https://forem.com/damari en dam-ari Wed, 19 Jun 2024 00:54:42 +0000 https://forem.com/damari/the-halting-problem-2o4a https://forem.com/damari/the-halting-problem-2o4a <p><em>This is a submission for <a href="https://dev.to/challenges/cs">DEV Computer Science Challenge v24.06.12: One Byte Explainer</a>.</em></p> <h2> Explainer </h2> <p>Can a program determine if another program will finish running or loop forever? It's the Halting Problem. Alan Turing proved it's undecidable: no algorithm can solve it for all possible programs. This limits what computers can predict about other programs.</p> <h2> Additional Context </h2> devchallenge cschallenge computerscience beginners dam-ari Wed, 19 Jun 2024 00:47:26 +0000 https://forem.com/damari/travelling-salesman-problem-tsp-5dc0 https://forem.com/damari/travelling-salesman-problem-tsp-5dc0 <p><em>This is a submission for <a href="https://dev.to/challenges/cs">DEV Computer Science Challenge v24.06.12: One Byte Explainer</a>.</em></p> <h2> Explainer </h2> <p>Can a salesman visit a set of cities, each once, and return to the start with the shortest route? This is an NP-hard problem, meaning no efficient algorithm exists for large numbers of cities. It's impacts logistics, DNA sequencing, and more.</p> <h2> Additional Context </h2> devchallenge cschallenge computerscience beginners