• garyyo@lemmy.world
      81·
      1 year ago

      Wait till you hear about oracle machines. They can solve any problem, even the halting problem.

      (It’s just another mathematical construct that you can do cool things with to prove certain things)

    • fubo@lemmy.world
      6·
      1 year ago

      If you augment a TM with nondeterminism, it can still be reduced to a deterministic TM.

    • rockSlayer@lemmy.world
      52·
      1 year ago

      Nondeterministic turing machines are the same kind of impossible theoretical automaton as an NFA. They can theoretically solve NP problems.

      • Christian@lemmy.ml
        1·
        1 year ago

        It’s been a long long time since I touched this but I’m still almost positive deterministic machines can solve everything in NP already.

        • rockSlayer@lemmy.world
          11·
          1 year ago

          They exist in the same grammatical hierarchy so theoretically they can solve the same problems. What I should have said was that nondeterministic turing machines can solve NP problems in P