placeholder page - just notes - to be completed ...
socio-organisational church turing hypouthesis
mobile and ubiquitous
computing power of evolution
finite processing and unbounded computation
move computation to data
e.g. Turing machine
lots of communicating computation
e.g. cellular autromata
move data to computation
e.g. traditional computer
magically tell computers
e.g. Kohonen net and ART
dutch national flag problem
sorting oracles and informnation
cube root N access
but concurrency -> sqrt N (3D), 2/3 root (2D)
but always O(N) slower 1D without program caching
complexity of algorithms and gross complexity of problems
information theoretic argument
N logR - prove it?
biggest 1 - information -> logN
why not N-1?
N-1 tests for sorted
put ... pointers have size! => O(NlogN) info
O(NlogD) count and bucket sort
location – where is information
comprehension – who understands information
FFT multiplication - properties!
control unit and arithmetic logical unit
Alan Dix 22/10/2002