Markov's Normal Algorithms are idealized sequential machines. Von Neumann's Cellular Automata are idealized parallel processing machines. This paper introduces a state-of-the-art of realizing cellular automata in terms of normal algorithms.
In this thesis, we address the problem of obtaining a "near optimal" solution to the uncapacitated network design problem. In the uncapacitated network design problem, each arc of a network has a fixed design cost for construction and a variable routing cost for routing each unit of flow. For each pair i,j of nodes, there is a demand of one unit of flow… (More)