Follow

Superintelligence cannot be contained. Mathematically proven! Ok, so the proof starts with Turing's Halting Problem, which is "undecidable". They extended this to the realm of AI and the question of harming humans. Imagine you have code for a robot that can harm humans. But before it runs the instructions to harm humans, it runs a program that could be endless. Since determining if the program terminates is undecidable, determining if the AI harms humans is undecidable. mpib-berlin.mpg.de/computer-sc

· · Web · 0 · 0 · 0
Sign in to participate in the conversation
Mastodon

Server run by the main developers of the project 🐘 It is not focused on any particular niche interest - everyone is welcome as long as you follow our code of conduct!