Advertisement
 Translation for 'nondeterministic' from English to Swedish
ADJ   nondeterministic | more nondeterministic | most nondeterministic
filos.inform.mate.
icke-deterministisk {adj}
nondeterministic
1 translation
To translate another word just start typing!

Translation for 'nondeterministic' from English to Swedish

nondeterministic
icke-deterministisk {adj}filos.inform.mate.
Advertisement
Usage Examples English
  • A probabilistic Turing machine is a type of nondeterministic Turing machine in which each nondeterministic step is a "coin-flip", that is, at each step there are two possible next moves and the Turing machine probabilistically selects which move to take.
  • The theorem can be proven by showing how to translate any nondeterministic Turing machine "M" into another nondeterministic Turing machine that solves the complementary decision problem under the same (asymptotic) space complexity, plus a constant number of pointers and counters, which needs only a logarithmic amount of space.
  • The idea of power domains for functions is that a nondeterministic function may be described as a deterministic set-valued function, where the set contains all values the nondeterministic function can take for a given argument.
  • Some of these models have both deterministic and nondeterministic variants.
  • In this context "NP" stands for "nondeterministic polynomial time".

  • In computational complexity theory, NL (Nondeterministic Logarithmic-space) is the complexity class containing decision problems that can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space.
  • A nondeterministic algorithm is different from its more familiar deterministic counterpart in its ability to arrive at outcomes using various routes.
  • In computer science theory – particularly formal language theory – Glushkov's construction algorithm, invented by Victor Mikhailovich Glushkov, transforms a given regular expression into an equivalent nondeterministic finite automaton (NFA).
  • Every deterministic ω-automaton can be regarded as a nondeterministic ω-automaton by taking Δ to be the graph of δ.
  • In automata theory, an alternating tree automaton (ATA) is an extension of nondeterministic tree automaton as same as alternating finite automaton extends nondeterministic finite automaton (NFA).

  • The name "NP-complete" is short for "nondeterministic polynomial-time complete".
  • It can also be decided automatically whether a nondeterministic machine with finite memory halts on none, some, or all of the possible sequences of nondeterministic decisions, by enumerating states after each possible decision.
  • , or if and only if there is a computable, nondecreasing, unbounded function f such that all languages recognised by a nondeterministic polynomial-time Turing machine using [...] nondeterministic choices are in "P".
Advertisement
© dict.cc Swedish-English dictionary 2024
Contains translations by TU Chemnitz and Mr Honey's Business Dictionary (German-English only).
Links to this dictionary or to individual translations are very welcome!