Intrinsically (n− 2)-dimensional cellular decompositions ofEn
نویسندگان
چکیده
منابع مشابه
Intrinsically universal n-dimensional quantum cellular automata
We describe an n-dimensional quantum cellular automaton (QCA) capable of simulating all others, in that the initial configuration and the forward evolution of any n-dimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each ...
متن کاملIntrinsically universal one-dimensional quantum cellular automata
We give a one-dimensional quantum cellular automata (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in ...
متن کاملIntrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any onedimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in ...
متن کاملN-Dimensional Gregory-Bezier for N-Dimensional Cellular Complexes
With industrial modelling tools, topological structures and free form surfaces are often managed separately, and patches used for embedding are limited to dimension 2. A new approach is to combine topology structures of any dimension with embedding of same dimension, and use topological operations to modify the shape and the properties of surfaces and volumes. The use of Chains of map as topolo...
متن کاملIntrinsically Universal Cellular Automata
This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing and circuit universality, we discuss construction methods for small intrinsically universal cellular automata before discussing techniques for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1982
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1982.102.275