Hamilton

William Hamilton

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Hal/S « Halt and Catch Fire « halting problem « Hamilton » Hamiltonian cycle » Hamiltonian path » Hamiltonian problem

Hamiltonian cycle

Hamiltonian problem

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Halt and Catch Fire « halting problem « Hamilton « Hamiltonian cycle » Hamiltonian path » Hamiltonian problem » Hamiltonian tour

Hamiltonian path

Hamiltonian problem

Try this search on Wikipedia, OneLook, Google

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.

http://ing.unlp.edu.ar/cetad/mos/Hamilton.html.

Last updated: 1997-07-18

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Hamilton « Hamiltonian cycle « Hamiltonian path « Hamiltonian problem » Hamiltonian tour » Hamilton's problem » hammer

Hamiltonian tour

Hamiltonian problem

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Hamiltonian cycle « Hamiltonian path « Hamiltonian problem « Hamiltonian tour » Hamilton's problem » hammer » Hamming code

Hamilton's problem

Hamiltonian problem

Try this search on Wikipedia, OneLook, Google

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]

Last updated: 1995-02-16

Try this search on Wikipedia, OneLook, Google

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?]

Last updated: 2002-07-02

Try this search on Wikipedia, OneLook, Google

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?].

Last updated: 2002-07-02

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Hamilton's problem « hammer « Hamming code « Hamming distance » Hamming, Richard » hamster » Han character

Hamming, Richard

Richard Hamming

Try this search on Wikipedia, OneLook, Google

Nearby terms:

hammer « Hamming code « Hamming distance « Hamming, Richard » hamster » Han character » HAND

hamster

<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.

<hardware> A tailless mouse; that is, one with an infrared link to a receiver on the machine, as opposed to the conventional cable.

<product> (UK) Any item of hardware made by Amstrad, a company famous for its cheap plastic PC-almost-compatibles.

[Jargon File]

Last updated: 1995-02-16

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Hamming code « Hamming distance « Hamming, Richard « hamster » Han character » HAND » hand cruft

Loading