Have a deep view into what people are curious about.

Codd's cellular automaton is a cellular automaton (CA) devised by the British computer scientist Edgar F. Codd in 1968. It was designed to recreate the computation- and construction-universality of von Neumann's CA but with fewer states: 8 instead of 29. Codd showed that it was possible to make a self-reproducing machine in his CA, in a similar way to von Neumann's universal constructor, but never gave a complete implementation.

A kakistocracy [kækɪ'stɑkrəsi] is a system of government that is run by the worst, least qualified, and/or most unscrupulous citizens. The word was coined as early as the seventeenth century, but gained significant use in the first decades of the 20th century to criticize populist governments emerging in different democracies around the world.

The Giffard dirigible or Giffard airship was an airship built in France in 1852 by Henri Giffard, the first powered and steerable (French: dirigeable – "directable") airship to fly. The craft featured an elongated hydrogen-filled envelope that tapered to a point at each end. From this was suspended a long beam with a triangular, sail-like rudder at its aft end, and beneath the beam a platform for the pilot and steam engine. Due to the highly flammable nature of the lift gas, special precautions were taken to minimise the potential for the envelope to be ignited by the engine beneath it. The engine's exhaust was diverted downwards to a long pipe projecting below the platform, and the area surrounding the boiler's stoke hole was surrounded by wire gauze. On 24 September 1852, Giffard flew the airship from the hippodrome at Place de l'Etoile to Élancourt, covering the 27 km (17 mi) in around 3 hours, demonstrating maneuvering along the way. The engine, however, was not sufficiently powerful to allow Giffard to fly against the wind to make a return journey.

Tilt! How to get bias into a Wikipedia article

To all you budding propagandists in Wikiland: too many of you are working like a bunch of amateurs. Sorry to be so negative, but you have to understand that getting bias into the Wikipedia is a skill; it requires practice, finesse and imagination. It has to be learned; it is not a natural thing, though some have more talent for it than others.

I have been following the Middle East Wikipedia battleground for a few years now, and have been very impressed with the skill of some editors in introducing bias into articles. To ingenuous editors, some of these techniques may seem innocuous enough; in many cases, it is hard to see how proposed edits are biasing an article one way or another. It is, in fact, only in the last few months that I have been able to define what these techniques are and how they work to introduce bias.

The first thing you need to know as a budding propagandist is this: there are two levels at which bias is introduced into the Wikipedia: at the article level, and at the topic level. You need to set your sights high: you don't want to merely bias a single article, you want the entire Wikipedia on your side. Without understanding the importance of topic bias, it is hard to understand many of the article-level techniques, so I will start with the topic level.

The Sussman anomaly is a problem in artificial intelligence, first described by Gerald Sussman, that illustrates a weakness of noninterleaved planning algorithms, which were prominent in the early 1970s. In the problem, three blocks (labeled A, B, and C) rest on a table. The agent must stack the blocks such that A is atop B, which in turn is atop C. However, it may only move one block at a time. The problem starts with B on the table, C atop A, and A on the table:

However, noninterleaved planners typically separate the goal (stack A atop B atop C) into subgoals, such as:

1. get A atop B
2. get B atop C

Suppose the planner starts by pursuing Goal 1. The straightforward solution is to move C out of the way, then move A atop B. But while this sequence accomplishes Goal 1, the agent cannot now pursue Goal 2 without undoing Goal 1, since both A and B must be moved atop C:

If instead the planner starts with Goal 2, the most efficient solution is to move B. But again, the planner cannot pursue Goal 1 without undoing Goal 2:

The problem was first identified by Sussman as a part of his PhD research. Sussman (and his supervisor, Marvin Minsky) believed that intelligence requires a list of exceptions or tricks, and developed a modular planning system for "debugging" plans. Most modern planning systems can handle this anomaly, but it is still useful for explaining why planning is non-trivial.

A porkchop plot (also pork-chop plot) is a chart that shows contours of equal characteristic energy (C₃) against combinations of launch date and arrival date for a particular interplanetary flight.

By examining the results of the porkchop plot, engineers can determine when launch opportunities exist (a launch window) that is compatible with the capabilities of a particular spacecraft. A given contour, called a porkchop curve, represents constant C₃, and the center of the porkchop the optimal minimum C₃. The orbital elements of the solution, where the fixed values are the departure date, the arrival date, and the length of the flight, were first solved mathematically in 1761 by Johann Heinrich Lambert, and the equation is generally known as Lambert's problem (or theorem).

A dial box is a computer peripheral for direct 3D manipulation e.g. to interactively input the rotation and torsion angles of a model displayed on a computer screen. Dial boxes were common input tools in the first years of interactive 3D graphics and they were available for Silicon Graphics (SGI) or Sun Microsystems and sold with their workstations. Currently they have been replaced by standard computer mouse interaction techniques.

Standard dial box has 8 dials mounted on a plate. The plate is set upright with the help of a stand and usually located next to the computer screen for convenient access. The connection to a computer is made via the serial port (RS-232).

One of the fields of application for dial boxes was molecular graphics.

Stigler's law of eponymy, proposed by University of Chicago statistics professor Stephen Stigler in his 1980 publication Stigler’s law of eponymy, states that no scientific discovery is named after its original discoverer. Examples include Hubble's law, which was derived by Georges Lemaître two years before Edwin Hubble, the Pythagorean theorem, which was known to Babylonian mathematicians before Pythagoras, and Halley's Comet, which was observed by astronomers since at least 240 BC (although its official designation is due to the first ever mathematical prediction of such astronomical phenomenon in the sky, not to its discovery). Stigler himself named the sociologist Robert K. Merton as the discoverer of "Stigler's law" to show that it follows its own decree, though the phenomenon had previously been noted by others.

A Lego tire is a rubber tire manufactured by the toy building block company The Lego Group for use on vehicles within their Lego building sets. The tires are available in a range of sizes depending on the application. Lego first began manufacturing tires in 1962 and included them in what would become their most popular set at the time. Previously, the only tire options for Lego users were either purchasing complete car kits from Lego, or building their own tires out of existing Lego blocks. Lego produced 318 million tires in 2011, making them the world's largest tire manufacturer by number of units produced.

Phantom OS is an operating system mostly made by Russian programmers. Phantom OS is based on a concept of persistent virtual memory, and is managed-code oriented. Phantom OS is one of a few OSes that are not based on classical concepts of Unix-like systems. Its primary goal is to achieve simplicity and effectiveness in both the operating system and applications at the same time.

Phantom is based on the principle that "Everything is an object", in contrast to the Unix-like approach of "Everything is a file".