| 摘要 |
The operation of an electronic neural computer is described. This electronic neural computer solves for the optimal path in a space of "cost functions" which are represented as delays at the nodes of a grid (in two, three, four, or more dimensions). Time gating by delays lets the optimal solution thread the maze of the network first. The neural computer starts to compute all possible paths through the cost function field and shuts down after the first (optimal solution) emerges at the target node. The cost function delays are set from outside the neural computer architecture.
|
