Finding:

1. close

   Nondeterministic finite state machine/Proofs

   Main article: Nondeterministic finite state machine ... For every NFA, there exists an equivalent DFA
2. close

   Powerset construction

   In the theory of computation and Automata theory, the powerset construction or subset construction is a standard method for converting a nondeterministic finite automaton (NFA) into a deterministic finite automaton (DFA) which recognizes the same formal language. ... For example, in the diagram in the example section, if we are at state 2 and the next input symbol is a 1, the machine branches, proceeding to both states 2 and 4.
3. close

   Turing machine

   Like the Universal Turing machine the RASP stores its "program" in "memory" external to its finite-state machine's "instructions". ... Graduate level text; most of Chapter XIII Computable functions is on Turing machine proofs of computability of recursive functions, etc.
4. close

   List of computability and complexity topics

   Computational complexity theory deals with how hard computations are, in quantitative terms, both with upper bounds (algorithms whose complexity in the worst cases, as use of computing resources, can be estimated), and from below (proofs that no procedure to carry out some task can be very fast). ... Nondeterministic finite state machine
5. close

   Outline of computability and complexity

   Computational complexity theory deals with how hard computations are, in quantitative terms, both with upper bounds (algorithms whose complexity in the worst cases, as use of computing resources, can be estimated), and from below (proofs that no procedure to carry out some task can be very fast). ... Nondeterministic finite state machine
6. close

   Union of two regular languages

   In formal language theory, and in particular the theory of nondeterministic finite state machines, it is known that the union of two regular languages is a regular language. ... Article proofs
7. close

   Halting problem

   "...any finite-state machine, if left completely to itself, will fall eventually into a perfectly periodic repetitive pattern. ... The concepts raised by Gödel's incompleteness theorems are very similar to those raised by the halting problem, and the proofs are quite similar.
8. close

   Computational complexity theory

   Even though some proofs of complexity-theoretic theorems regularly assume some concrete choice of input encoding, one tries to keep the discussion abstract enough to be independent of the choice of encoding. ... Since it is widely believed that the polynomial hierarchy does not collapse to any finite level, it is believed that graph isomorphism is not NP-complete.
9. close

   Algorithm characterizations

   The proofs that every "recursive function" we can calculate by hand we can compute by machine and vice versa—note the usage of the words calculate versus compute -- is remarkable. ... 1 An algorithm is a set of instructions of finite size,
10. close

    IP (complexity)

    be a finite field with order ... Moreover, all languages in NP have zero-knowledge proofs in an MIP system, without any additional assumptions; this is only known for IP assuming the existence of one-way functions.

Explore the following pages on Powerset:

• Nondeterministic finite state machine/Proofs,
• Powerset construction,
• Turing machine,
• List of computability and complexity topics,
• Outline of computability and complexity,
• Union of two regular languages,
• Halting problem,
• Computational complexity theory,
• Algorithm characterizations,
• IP (complexity)

Try this on Bing Research

Bing