Hamilton
William Hamilton
Nearby terms:
Hal/S « Halt and Catch Fire « halting problem «
Hamilton
» Hamiltonian cycle » Hamiltonian path » Hamiltonian
problem
Hamiltonian cycle
Hamiltonian problem
Nearby terms:
Halt and Catch Fire « halting problem « Hamilton «
Hamiltonian cycle » Hamiltonian path »
Hamiltonian problem » Hamiltonian tour
Hamiltonian path
Hamiltonian problem
Nearby terms:
halting problem « Hamilton « Hamiltonian cycle «
Hamiltonian path » Hamiltonian problem »
Hamiltonian tour » Hamilton's problem
Hamiltonian problem
<computability> (Or "Hamilton's problem") A problem in graph theory posed
by William Hamilton: given a graph, is there a path through the graph which
visits each vertex precisely once (a "Hamiltonian path")? Is there a Hamiltonian
path which ends up where it started (a "Hamiltonian cycle" or "Hamiltonian
tour")?
Hamilton's problem is NP-complete. It has numerous applications, sometimes
completely unexpected, in computing.
Home.
(1997-07-18)
Nearby terms:
Hamilton « Hamiltonian cycle « Hamiltonian path «
Hamiltonian problem » Hamiltonian tour »
Hamilton's problem » hammer
Hamiltonian tour
Hamiltonian problem
Nearby terms:
Hamiltonian cycle « Hamiltonian path « Hamiltonian
problem «
Hamiltonian tour » Hamilton's problem » hammer »
Hamming code
Hamilton's problem
Hamiltonian problem
Nearby terms:
Hamiltonian path « Hamiltonian problem « Hamiltonian
tour «
Hamilton's problem » hammer » Hamming code »
Hamming distance
hammer
Commonwealth hackish synonym for bang on.
[Jargon File]
(1995-02-16)
Nearby terms:
Hamiltonian problem « Hamiltonian tour « Hamilton's
problem « hammer » Hamming code » Hamming
distance » Hamming, Richard
Hamming code
<algorithm> Extra, redundant bits added to stored or transmitted data for
the purposes of error detection and correction.
Named after the mathematician Richard Hamming, Hamming codes greatly improve the
reliability of data, e.g. from distant space probes, where it is impractical,
because of the long transmission delay, to correct errors by requesting
retransmission.
[Detail? Connection with Hamming Distance?]
(2002-07-02)
Nearby terms:
Hamiltonian tour « Hamilton's problem « hammer «
Hamming code » Hamming distance » Hamming,
Richard » hamster
Hamming distance
<data> The minimum number of bits that must be changed in order to
convert one bit string into another.
Named after the mathematician Richard Hamming.
[Connection with Hamming code?].
(2002-07-02)
Nearby terms:
Hamilton's problem « hammer « Hamming code «
Hamming distance » Hamming, Richard » hamster »
Han character
Hamming, Richard
Richard Hamming
Nearby terms:
hammer « Hamming code « Hamming distance «
Hamming, Richard » hamster » Han character »
HAND
hamster
1. <programming> (From Fairchild) A particularly slick little piece of
code that does one thing well; a small, self-contained hack. The image is of a
hamster happily spinning its exercise wheel.
2. <hardware> A tailless mouse; that is, one with an infrared link to a
receiver on the machine, as opposed to the conventional cable.
3. <product> (UK) Any item of hardware made by Amstrad, a company famous
for its cheap plastic PC-almost-compatibles.
[Jargon File]
(1995-02-16)
Nearby terms:
Hamming code « Hamming distance « Hamming, Richard «
hamster » Han character » HAND » hand cruft
|
