The Tunnel Problem is a variation on a problem in which you have two what?
272f74ce74525519738f72c5844cb556
Tunnel problem The Tunnel Problem is a philosophical thought experiment first introduced by Jason Millar. It is a variation on the classic Trolley Problem, a thought experiment introduced in the 1960s, and much discussed ever since. The tunnel problem is intended to draw one's attention to a specific issue in design/engineering ethics, and was first presented as follows:
ac665335f7afbaa1a7caaf394a194c2d
Trolley problem The trolley problem is a thought experiment in ethics. The general form of the problem is this:There is a runaway trolley barreling down the railway tracks. Ahead, on the tracks, there are five people tied up and unable to move. The trolley is headed straight for them. You are standing some distance off in the train yard, next to a lever. If you pull this lever, the trolley will switch to a different set of tracks. However, you notice that there is one person on the side track. You have two options:
3bdaa7786ccf4850fe61b8947abd3569
Angle trisection Angle trisection is a classical problem of compass and straightedge constructions of ancient Greek mathematics. It concerns construction of an angle equal to one third of a given arbitrary angle, using only two tools: an unmarked straightedge, and a compass.
3e987b34357f6188739e75700d247dc7
Multiple rule-based problems Multiple rule-based problems are problems containing various conflicting rules and restrictions. Such problems typically have an "optimal" solution, found by striking a balance between the various restrictions, without directly defying any of the aforementioned restrictions.
179b9fc0a8c49d83f1e0e1f58783012c
Post correspondence problem The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946. Because it is simpler than the halting problem and the "Entscheidungsproblem" it is often used in proofs of undecidability.
2e0822114451cc7d306f7d2f7e73c260
1-center problem The 1-center problem or minimax or minmax location problem is a classical combinatorial optimization problem in operations research of facilities location type. In its most general case the problem is stated as follows: given a set of n demand points, a space of feasible locations of a facility and a function to calculate the transportation cost between a facility and any demand point, find a location of the facility which minimizes the maximum facility-demand point transportation cost.
04d26d6ea7db289053eee95d0600c0f3
Coincidence of wants The coincidence of wants problem (often "double coincidence of wants") is the situation where the supplier of good A wants good B and the supplier of good B wants good A
7bf5885e1c66c159f529d6b4bbf3bc14
Hidden subgroup problem The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. The framework captures problems like factoring, graph isomorphism, and the shortest vector problem. This makes it especially important in the theory of quantum computing because Shor's quantum algorithm for factoring is essentially equivalent to the hidden subgroup problem for finite Abelian groups, while the other problems correspond to finite groups that are not Abelian.
1f1100ef771d9c4bc61439225277de63
Nonelementary problem In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY.
7d4fb7ebd75aa648e56c857699b76847
Guillotine problem The guillotine problem is a problem in combinatorial geometry and in printing.
454d1b4139271c4af912ac1fd7843b4e
Missionaries and cannibals problem The missionaries and cannibals problem, and the closely related jealous husbands problem, are classic river-crossing problems. The missionaries and cannibals problem is a well-known toy problem in artificial intelligence, where it was used by Saul Amarel as an example of problem representation.
68dc1aa5ec60684d8d9f8a8f01e3061d
Carrier's constraint Carrier's constraint is the observation that air-breathing vertebrates which have two lungs and flex their bodies sideways during locomotion find it very difficult to move and breathe at the same time, because the sideways flexing expands one lung and compresses the other, shunting stale air from lung to lung instead of expelling it completely to make room for fresh air.
4c5a9fe465a3f8d23966c3e9945794b9
Wall's conjecture In mathematics, Wall's conjecture denotes one of the following:
1c9f8eec6d2e6d3971e0035444081015
Hilbert's eleventh problem Hilbert's eleventh problem is one of David Hilbert's list of open mathematical problems posed at the Second International Congress of Mathematicians in Paris in 1900. A furthering of the theory of quadratic forms, he stated the problem as follows:
3176c14f4242f909ec1777b72c87c188
Tunnel transmitter A tunnel transmitter allows wireless reception in tunnels. It consists of a receiving antenna which receives the signal to be radiated in the tunnel, and a transmitting antenna installed in the tunnel, which is either a Yagi antenna or a line antenna. In principle, a tunnel transmitter can work purely passively, in which case the received signal is passed over a cable to the antenna in the tunnel. Active systems, however, are more often used. In some cases the radio frequency inside the tunnel is different from the one used by the broadcaster. More often the program inside is transmitted on the same frequency as outside, in which case the information signal should be demodulated or converted to an intermediate frequency in the outside receiver, and then modulated/shifted back in the transmitter. Otherwise feedback may occur.
1b8a9592ae1090b6a321f0b459d75ac4
Doubling the cube Doubling the cube, also known as the Delian problem, is an ancient geometric problem. Given the edge of a cube, the problem requires the construction of the edge of a second cube whose volume is double that of the first, using only the tools of a compass and straightedge. As with the related problems of squaring the circle and trisecting the angle, doubling the cube is now known to be impossible.
2cb467f24fd9a3a93a44759fb6d03718
Bernoulli trial In the theory of probability and statistics, a Bernoulli trial (or binomial trial) is a random experiment with exactly two possible outcomes, "success" and "failure", in which the probability of success is the same every time the experiment is conducted. It is named after Jacob Bernoulli, a 17th century Swiss mathematician.
3b1ff2fa8184497872ade74b2e96fc1a
Prisoner's dilemma (disambiguation) The prisoner's dilemma is a standard example in game theory that shows why two individuals might not cooperate, even if it appears that it is in their best interests to do so.
d553d7b09584fae03e403e0a78b370b1
Wheeling Tunnel Twin tunnels form the Wheeling Tunnel in Wheeling, Ohio County, West Virginia. The tunnels are 0.27 mi long, cutting though Wheeling Hill, and each carries two lanes of Interstate 70 and U.S. Route 250. The tunnels originally took three years to construct, costing $6.9 million. Reconstruction of the tunnel, originally planned to take a total of 6 months, took over three years to complete between 2007 and 2010, at a cost of $13.7 million.
b365a7cc4ab5528a4f1e32e68f0a0d58
Tunnelling shield A tunnelling shield is a protective structure used during the excavation of large, man-made tunnels. When excavating through ground that is soft, liquid, or otherwise unstable, there is a risk to workers and the project itself from falling materials and/or a cave-in. A tunnelling shield serves as a temporary support structure. It is in place for the usually short time from when the tunnel section is excavated until it can be lined with a permanent support structure. The permanent structure may be made up of, depending on the period, bricks, concrete, cast iron, or steel. Although modern shields are commonly cylindrical, the first "shield", designed by Marc Isambard Brunel, was actually a large, rectangular, scaffold-like iron structure with three levels and a solid weight-bearing top — see picture to the right. The structure nevertheless protected the men from cave-ins as they laboured within it, digging the tunnel out in front of themselves.
35635c17463685a43c2137938b26359e
Urn problem In probability and statistics, an urn problem is an idealized mental exercise in which some objects of real interest (such as atoms, people, cars, etc.) are represented as colored balls in an urn or other container. One pretends to remove one or more balls from the urn; the goal is to determine the probability of drawing one color or another,
04e5ea767ea133a87937f87cf34a6c9a
Hidden transformation The hidden transformation reformulates a constraint satisfaction problem in such a way all constraints have at most two variables. The new problem is satisfiable if and only if the original problem was, and solutions can be converted easily from one problem to the other.