I can't imagine that's possible. Else I'd solve the halting problem by brute forcing the secret to the trapdoor. Contradiction.
-
-
-
Not the case. The halting problem is trivially solved for some subsets of programs, and trivially solved for other subsets when certain information about state is known. Solving these doesn't contradict the hardness proofs of the wider halting problem.
- Još 6 drugih odgovora
Novi razgovor -
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.