Search Results for ""

A generalized mobile automaton is a generalization of the mobile automaton in which the automaton may have more than one active cell. Generalized mobile automata allow for ...

A class of automata similar to cellular automata but which have a single "active" cell instead of updating all cells in parallel. In a mobile automaton, the evolution rules ...

A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...

A very useful active feedback method for controlling things like temperature control systems, servo motors, and flow control valves.

The Coulomb wave function is a special case of the confluent hypergeometric function of the first kind. It gives the solution to the radial Schrödinger equation in the ...

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

A set of 15 open problems on Schrödinger operators proposed by mathematical physicist Barry Simon (2000). This set of problems follows up a 1984 list of open problems in ...

A multiway system that generates causal networks which are all isomorphic as acyclic digraphs is said to exhibit causal invariance, and the causal network itself is also said ...

For any constructible function f, there exists a function P_f such that for all functions t, the following two statements are equivalent: 1. There exists an algorithm A such ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...