|
WireWorld
Wireworld, alternatively WireWorld, is a cellular automaton first proposed by Brian Silverman in 1987, as part of his program Phantom Fish Tank. It subsequently became more widely known as a result of an article in the "Computer Recreations" column of ''Scientific American''. Wireworld is particularly suited to simulating transistors, and is Turing-complete. Rules A Wireworld cell can be in one of four different states, usually numbered 0–3 in software, modeled by colors in the examples here: empty (black), electron head (blue), electron tail (red), conductor (yellow). As in all cellular automata, time proceeds in discrete steps called generations (sometimes "gens" or "ticks"). Cells behave as follows: * empty → empty, * electron head → electron tail, * electron tail → conductor, * conductor → electron head if exactly one or two of the neighbouring cells are electron heads, otherwise remains conductor. Wireworld uses what is called the Moore neighborhood, which ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wireworld Two-diodes
Wireworld, alternatively WireWorld, is a cellular automaton first proposed by Brian Silverman in 1987, as part of his program Phantom Fish Tank. It subsequently became more widely known as a result of an article in the "Computer Recreations" column of ''Scientific American''. Wireworld is particularly suited to simulating transistors, and is Turing-complete. Rules A Wireworld cell can be in one of four different states, usually numbered 0–3 in software, modeled by colors in the examples here: empty (black), electron head (blue), electron tail (red), conductor (yellow). As in all cellular automata, time proceeds in discrete steps called generations (sometimes "gens" or "ticks"). Cells behave as follows: * empty → empty, * electron head → electron tail, * electron tail → conductor, * conductor → electron head if exactly one or two of the neighbouring cells are electron heads, otherwise remains conductor. Wireworld uses what is called the Moore neighborhood, which ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wireworld XOR-gate
Wireworld, alternatively WireWorld, is a cellular automaton first proposed by Brian Silverman in 1987, as part of his program Phantom Fish Tank. It subsequently became more widely known as a result of an article in the "Computer Recreations" column of ''Scientific American''. Wireworld is particularly suited to simulating transistors, and is Turing-complete. Rules A Wireworld cell can be in one of four different states, usually numbered 0–3 in software, modeled by colors in the examples here: empty (black), electron head (blue), electron tail (red), conductor (yellow). As in all cellular automata, time proceeds in discrete steps called generations (sometimes "gens" or "ticks"). Cells behave as follows: * empty → empty, * electron head → electron tail, * electron tail → conductor, * conductor → electron head if exactly one or two of the neighbouring cells are electron heads, otherwise remains conductor. Wireworld uses what is called the Moore neighborhood, which ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cellular Automaton
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. Cellular automata have found application in various areas, including physics, theoretical biology and microstructure modeling. A cellular automaton consists of a regular grid of ''cells'', each in one of a finite number of '' states'', such as ''on'' and ''off'' (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its ''neighborhood'' is defined relative to the specified cell. An initial state (time ''t'' = 0) is selected by assigning a state for each cell. A new ''generation'' is created (advancing ''t'' by 1), according to some fixed ''rule'' (generally, a mathematical function) that determines the new state o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brian Silverman
Brian Silverman is a Canadian computer scientist, the creator of many programming environments for children,Computing Pioneer Returns to CMK 2010 Faculty! , Constructing Modern Knowledge, September 29, 2010. and a researcher in . Silverman was a student at the in the 1970s, where he was one of the creators of a computer that pl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Scientific American
''Scientific American'', informally abbreviated ''SciAm'' or sometimes ''SA'', is an American popular science magazine. Many famous scientists, including Albert Einstein and Nikola Tesla, have contributed articles to it. In print since 1845, it is the oldest continuously published magazine in the United States. ''Scientific American'' is owned by Springer Nature, which in turn is a subsidiary of Holtzbrinck Publishing Group. History ''Scientific American'' was founded by inventor and publisher Rufus Porter in 1845 as a four-page weekly newspaper. The first issue of the large format newspaper was released August 28, 1845. Throughout its early years, much emphasis was placed on reports of what was going on at the U.S. Patent Office. It also reported on a broad range of inventions including perpetual motion machines, an 1860 device for buoying vessels by Abraham Lincoln, and the universal joint which now can be found in nearly every automobile manufactured. Current issues includ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transistor
upright=1.4, gate (G), body (B), source (S) and drain (D) terminals. The gate is separated from the body by an insulating layer (pink). A transistor is a semiconductor device used to Electronic amplifier, amplify or electronic switch, switch electrical signals and electrical power, power. The transistor is one of the basic building blocks of modern electronics. It is composed of semiconductor material, usually with at least three terminals for connection to an electronic circuit. A voltage or current applied to one pair of the transistor's terminals controls the current through another pair of terminals. Because the controlled (output) power can be higher than the controlling (input) power, a transistor can amplify a signal. Some transistors are packaged individually, but many more are found embedded in integrated circuits. Austro-Hungarian physicist Julius Edgar Lilienfeld proposed the concept of a field-effect transistor in 1926, but it was not possible to actually cons ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Turing-complete
In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine (devised by English mathematician and computer scientist Alan Turing). This means that this system is able to recognize or decide other data-manipulation rule sets. Turing completeness is used as a way to express the power of such a data-manipulation rule set. Virtually all programming languages today are Turing-complete. A related concept is that of Turing equivalence two computers P and Q are called equivalent if P can simulate Q and Q can simulate P. The Church–Turing thesis conjectures that any function whose values can be computed by an algorithm can be computed by a Turing machine, and therefore that if any real-world computer can simulate a Turing machine, it is Turing equivalent to a Turing machine. A universal ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Animated Display
Animation is a method by which still figures are manipulated to appear as moving images. In traditional animation, images are drawn or painted by hand on transparent celluloid sheets to be photographed and exhibited on film. Today, most animations are made with computer-generated imagery (CGI). Computer animation can be very detailed 3D animation, while 2D computer animation (which may have the look of traditional animation) can be used for stylistic reasons, low bandwidth, or faster real-time renderings. Other common animation methods apply a stop motion technique to two- and three-dimensional objects like paper cutouts, puppets, or clay figures. A cartoon is an animated film, usually a short film, featuring an exaggerated visual style. The style takes inspiration from comic strips, often featuring anthropomorphic animals, superheroes, or the adventures of human protagonists. Especially with animals that form a natural predator/prey relationship (e.g. cats and mice ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moore Neighborhood
In cellular automata, the Moore neighborhood is defined on a two-dimensional square lattice and is composed of a central cell and the eight cells that surround it. Name The neighborhood is named after Edward F. Moore, a pioneer of cellular automata theory. Importance It is one of the two most commonly used neighborhood types, the other one being the von Neumann neighborhood, which excludes the corner cells. The well known Conway's Game of Life, for example, uses the Moore neighborhood. It is similar to the notion of 8-connected pixels in computer graphics. The Moore neighbourhood of a cell is the cell itself and the cells at a Chebyshev distance of 1. The concept can be extended to higher dimensions, for example forming a 26-cell cubic neighborhood for a cellular automaton in three dimensions, as used by 3D Life. In dimension ''d,'' where 0 \le d, d \in \mathbb, the size of the neighborhood is 3''d'' − 1. In two dimensions, the number of cells in an ''ex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logic Gate
A logic gate is an idealized or physical device implementing a Boolean function, a logical operation performed on one or more binary inputs that produces a single binary output. Depending on the context, the term may refer to an ideal logic gate, one that has for instance zero rise time and unlimited fan-out, or it may refer to a non-ideal physical device (see Ideal and real op-amps for comparison). Logic gates are primarily implemented using diodes or transistors acting as electronic switches, but can also be constructed using vacuum tubes, electromagnetic relays ( relay logic), fluidic logic, pneumatic logic, optics, molecules, or even mechanical elements. Now, most logic gates are made from MOSFETs (metal–oxide–semiconductor field-effect transistors). With amplification, logic gates can be cascaded in the same way that Boolean functions can be composed, allowing the construction of a physical model of all of Boolean logic, and therefore, all of the algorithms ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Von Neumann Cellular Automaton
Von Neumann cellular automata are the original expression of cellular automata, the development of which was prompted by suggestions made to John von Neumann by his close friend and fellow mathematician Stanislaw Ulam. Their original purpose was to provide insight into the logical requirements for machine self-replication, and they were used in von Neumann's universal constructor. Nobili's cellular automaton is a variation of von Neumann's cellular automaton, augmented with the ability for confluent cells to cross signals and store information. The former requires an extra three states, hence Nobili's cellular automaton has 32 states, rather than 29. Hutton's cellular automaton is yet another variation, which allows a loop of data, analogous to Langton's loops, to replicate. Definition Configuration In general, cellular automata (CA) constitute an arrangement of finite state automata (FSA) that sit in positional relationships between one another, each FSA exchanging inf ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Transistor"){kind=spacer}
