Any non-affine one-to-one binary gate suffices for computation
نویسنده
چکیده
Any non-affine one-to-one binary gate can be wired together with suitable inputs to give AN D, OR, N OT and fan-out gates, and so suffices to construct a general-purpose computer.
منابع مشابه
An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملua nt - p h / 02 05 11 5 v 1 1 8 M ay 2 00 2 Toffoli or Control - NOT needs little help to do universal quantum computation
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis. The result of Gottesman and Knill [3] implies that any quantum circuit involving only the Control-NOT and Hadamard gates can be efficiently simulated by a clas...
متن کاملua nt - p h / 02 05 11 5 v 2 2 6 M ay 2 00 2 Both Toffoli and Controlled - NOT need little help to do universal quantum computation 1
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis. The result of Gottesman and Knill [3] implies that any quantum circuit involving only the Controlled-NOT and Hadamard gates can be efficiently simulated by a c...
متن کاملExplicit Model Predictive Control of Fast Dynamic System
Explicit Model Predictive Control approach provides offline computation of the optimization law by Multi Parametric Quadratic Programming. The solution is Piece wise affine in nature. It is explicit representation of the system states and control inputs. Such law then can be solved using binary search tree and can be evaluated for fast dynamic systems. Implementing such controllers can be done ...
متن کاملA New Near Optimal High Gain Controller For The Non-Minimum Phase Affine Nonlinear Systems
In this paper, a new analytical method to find a near-optimal high gain controller for the non-minimum phase affine nonlinear systems is introduced. This controller is derived based on the closed form solution of the Hamilton-Jacobi-Bellman (HJB) equation associated with the cheap control problem. This methodology employs an algebraic equation with parametric coefficients for the systems with s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1504.03376 شماره
صفحات -
تاریخ انتشار 2015