Hash table - Definition
In computer science, a hash table is a data structure that speeds up searching for information by a particular aspect of that information, called a key.
Hash tables should not be confused with the hash lists and hash trees used in cryptography and data transmission.
Contents
1 Hash function ...
Hash tables
Indexed arrays take up a lot of memory to store all the nodes that are not in the OPEN set. An alternative is to use a hash table, with a hash function h(n) that maps each node n into a hash code.
n do for each subset A, of A of size /' do if CONSISTENT-DET(Ai,E) then return A, end end function CONSISTENT-DET(A, E) returns a truth-value inputs: A, a set of attributes E, a set of examples local variables: H, a hash table for each example e ...
I agree that if a program was a huge hash table of possible answers that were arranged according to question, and it was a simple case of retrieval, then the program wouldn't be intelligent. Yet, most modern programs do not act as retrieval systems.
 See also: Search algorithm, Knowledge, Branch, Artificial intelligence, Distribution
  
|
RSS
