Sign inSign in

Non-determinism

One word, taught differently in 2 fields. Each use is given apart.

In Theory & Algos

A computational model where the machine can be in multiple states or follow multiple paths simultaneously, accepting if at least one path reaches an accept state.
as Michael Sipser defines itMITThe wording closest to all 3 definitions

In Systems & CS

The behavior where running the same prompt and task yields different code output even at temperature zero.

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Complement1Computation tree1Deterministic machine1LLMs1NFA1Prompt engineering1Turing machine1

Opens up

Concepts that name this one as a prerequisite.

In Theory & Algos

1
  • Michael Sipser

    MIT · Undergraduate

    • 37:25P and NP, SAT, Poly-Time Reducibility
    • 20:00Probabilistic Computation, BPP

In Systems & CS

1

    Lectures that assume it

    7

    Connections

    17

    The lectures that define it or assume it, and the concepts next to it.

    2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.