![Page 1: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/1.jpg)
Highly Programmable Matter& Generalized Computation
Research in ReconfigurableAnalog & Digital Computation
In Bulk Materials
Bruce J. MacLennanDept. of Computer Science
University of Tennessee, Knoxville
![Page 2: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/2.jpg)
14 Feb. 2007 Highly Programmable Matter 2
“Radical Reconfiguration”• Ordinary reconfiguration changes connections
among fixed components• Radical reconfiguration of transducers
– to create new sensors & actuators• Radical reconfiguration of processors
– to reallocate matter to different components
• Also for repair & damage recovery• Requires rearrangement of atoms and molecules
into new components• Requires “molar parallelism”
![Page 3: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/3.jpg)
14 Feb. 2007 Highly Programmable Matter 3
Our Ongoing Research inRadical Reconfiguration
• Programmable matter– Computational control of matter– Molecular combinatory computing– Morphogenetic approaches
• Generalized computation– Flexible general computing medium– Encompassing both analog & digital– U-machine
![Page 4: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/4.jpg)
14 Feb. 2007 Highly Programmable Matter 4
Molecular Combinatory Computing• Comb. comp. based on two graph substitutions
– computationally universal– can compile programs into these computational graphs
• Can proceed asynchronously & in parallel• Program computes into structure represented in molecules• Supported by NSF (Nanoscale Exploratory Research)
![Page 5: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/5.jpg)
14 Feb. 2007 Highly Programmable Matter 5
Morphogenetic Approaches
• Based on models ofembryologicaldevelopment
• Cells migrate by localinteraction & chemicalsignals
• Possible implemen-tation: “programmable”micro-organisms
![Page 6: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/6.jpg)
14 Feb. 2007 Highly Programmable Matter 6
Computation in General Sense• A definition applicable to computation in
nature as well as computers• Computation is a physical process, the
purpose of which is abstract operation onabstract objects
• A computation must be implemented bysome physical system, but it may beimplemented by any physical system withthe appropriate abstract structure
![Page 7: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/7.jpg)
14 Feb. 2007 Highly Programmable Matter 7
Abstract Spaces
• Should be general enough to includecontinuous & discrete spaces
• Hypothesis: separable metric spaces• Include continua & countable discrete
spaces• separable ⇒ approximating sequences
![Page 8: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/8.jpg)
14 Feb. 2007 Highly Programmable Matter 8
The U-Machine• Goal: a model of computation over abstract
spaces that can be implemented in a varietyof physical media
• In particular, bulk nanostructured materialsin which:– access to interior is limited– detailed control of structure is difficult– structural defects and other imperfections are
unavoidable
![Page 9: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/9.jpg)
14 Feb. 2007 Highly Programmable Matter 9
Urysohn Embedding• A separable metric space is homeomorphic
to a subset of a Hilbert space• Let (X, δ) be separable metric space• Let b1, b2, … ∈ X be a ctbl dense subset• WLOG suppose δ is bounded in [0, 1]• Let similarity σ(x, y) = 1 – δ(x, y)• Define:
!
U x( ) =" x,b
1( )1
," x,b
2( )2
," x,b
3( )3
,K#
$ %
&
' (
![Page 10: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/10.jpg)
14 Feb. 2007 Highly Programmable Matter 10
Urysohn Embedding
![Page 11: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/11.jpg)
14 Feb. 2007 Highly Programmable Matter 11
ε-Nets
![Page 12: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/12.jpg)
14 Feb. 2007 Highly Programmable Matter 12
Field Computation
• Field = continuousdistribution ofcontinuous quantity= element of Hilbertfunction space
• uk used to scale basisfunctions
• Linear superpositionrepresents element ofabstract space
![Page 13: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/13.jpg)
14 Feb. 2007 Highly Programmable Matter 13
Computation in Hilbert Space
!
X,"X( )
!
Y,"Y( )
!
Z,"Z( )
φ ψ
!
Q"
!
Q"
!
Q"
f g
U V W
!
0,1[ ]m
!
0,1[ ]l
!
0,1[ ]n
!
ˆ f
!
ˆ g
!
pl( )
!
pm( )
!
pn( )
![Page 14: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/14.jpg)
14 Feb. 2007 Highly Programmable Matter 14
An Abstract Cortex• Finite-dimensional
representations ofabstract spaces can beallocated disjointregions in data space
• Field representationscan be allocated toseparated regions
• Analogous to regionsin neural cortex
![Page 15: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/15.jpg)
14 Feb. 2007 Highly Programmable Matter 15
Decomposition of Computations
• Complex computations may be decomposedinto simpler ones
• Variable regions provide interfaces betweenconstituent computational processes
• For “radical reconfiguration”: don’t build inspecific primitive processes
• How are primitive processes implemented?
![Page 16: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/16.jpg)
14 Feb. 2007 Highly Programmable Matter 16
Implementation ofPrimitive Computations
• There are several “universal approximationtheorems” that make use of approximationsof the form:
• Works for a variety of simple nonlinear“basis functions” rj
!
v = F u( ) "r # j rj u( )
j=1
H
$
![Page 17: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/17.jpg)
14 Feb. 2007 Highly Programmable Matter 17
Example Interpolation Method• Training samples: (x1, y1), …, (xP, yP)• Hilbert space reprs.: uk = U(xk), vk = V(yk)• Interpolation conditions:
• Let• Exact interpolation: V = RA• Best (least squares) approx.: A ≈ R+V
where R+ = (RTR)–1RT
!
vk =
r " j rj u
k( )j
#
!
Vki = vik, Rkj = rj u
k( ), A ji =" i
j
![Page 18: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/18.jpg)
14 Feb. 2007 Highly Programmable Matter 18
Typical Basis Functions• Perceptron-style: rj(u) = r(wj ⋅ u + bj)
• Radial-basis functions:
• Green’s function for stabilizer: rj(u) = G (u, uj)
• Key point: lots of choices!
rj u( ) = r u" c j( )
![Page 19: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/19.jpg)
14 Feb. 2007 Highly Programmable Matter 19
Determination ofInterconnection Matrices
• Unknown functions: neural-net training• Known function — compute offline by:
– Generating sufficient interpolation samples, or:– Determining matrices analytically
• Typical primitives could include thosefound typically on analog or digitalcomputers
![Page 20: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/20.jpg)
14 Feb. 2007 Highly Programmable Matter 20
Merging Linear Transforms• General form of approximation:
v = A r(Bu) , where [r(Bu)]j = r([Bu]j)• Suppose: w = A′ r′(B′v)• Linear parts can be combined:
w = A′ r′[C r(Bu)], where C = B′A• Two basic operations:
– Matrix-vector multiplication– Simple point-wise nonlinear function r
![Page 21: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/21.jpg)
14 Feb. 2007 Highly Programmable Matter 21
Input Transduction• Input space: (X, δ)• Suitable ε-net: (b1, b2, …, bn)• Hilbert-space representation u = U(x):
uk = σ (x, bk),where σ (x, bk) = 1 – δ (x, bk)
• In effect have fuzzy feature detectors: σk(x) = σ (x, bk)
• Thus u = (σ1(x), σ2(x), …, σn(x) )T
![Page 22: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/22.jpg)
14 Feb. 2007 Highly Programmable Matter 22
Output Transduction• Physical output spaces are usually vector
spaces• Approximate by:
• This summation is a physical superpositionof physical vectors aj
• Compute approximation parameters in anyof the usual ways
!
y =V "1v( ) # a
jrj v( )
j=1
H
$
![Page 23: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/23.jpg)
14 Feb. 2007 Highly Programmable Matter 23
Real-time Computation
• Time-varying input & outputs x(t) arerepresented by time varying vectors u(t)
• Differential changes are computed likeother functions
• Differential changes are integrated intovariable regions
![Page 24: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/24.jpg)
14 Feb. 2007 Highly Programmable Matter 24
(Re-)Configuration Methods
![Page 25: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/25.jpg)
14 Feb. 2007 Highly Programmable Matter 25
Overall Structure• Variable (data) space
– Large number of scalar variables for Hilbertcoefficients
– Partitioned into regions representing abstractspaces
• Function (program) space– Flexible interconnection (∴ 3D)– Programmable linear combinations– Application of basis functions
![Page 26: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/26.jpg)
14 Feb. 2007 Highly Programmable Matter 26
Depiction of UM Interior
• Shell contains variableareas & computationalelements
• Interior filled withsolid or liquid matrix(not shown)
• Paths formed throughor from matrix
![Page 27: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/27.jpg)
14 Feb. 2007 Highly Programmable Matter 27
Layers in Data Space
• Connection matrix hasprogrammable weights
• Linear combinations areinputs to nonlinear basisfunctions
• Exterior access to bothsides for programming
![Page 28: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/28.jpg)
14 Feb. 2007 Highly Programmable Matter 28
Depiction of UM Exterior
![Page 29: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/29.jpg)
14 Feb. 2007 Highly Programmable Matter 29
Diffusion-Based Path Routing
![Page 30: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/30.jpg)
14 Feb. 2007 Highly Programmable Matter 30
Example Path-Routing Process• Attractant diffuses from destination
– Could be chemical, electrons, molecular state– Attractant degrades
• Existing paths clamp attractant to 0– Effectively repel new path
• Path “grows” from source by climbing attractantgradient– Attractant injection rate ramped up
• After connection made, attractant allowed todecay before routing next path
![Page 31: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/31.jpg)
14 Feb. 2007 Highly Programmable Matter 31
Example of Path Routing
• Starts and ends chosenrandomly
• Quiescent interval (forattractant decay)omitted from video
• Each path occupies~0.1% of space
• Total: ~4%
![Page 32: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/32.jpg)
14 Feb. 2007 Highly Programmable Matter 32
Front
![Page 33: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/33.jpg)
14 Feb. 2007 Highly Programmable Matter 33
Right
![Page 34: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/34.jpg)
14 Feb. 2007 Highly Programmable Matter 34
Back
![Page 35: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/35.jpg)
14 Feb. 2007 Highly Programmable Matter 35
Left
![Page 36: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/36.jpg)
14 Feb. 2007 Highly Programmable Matter 36
Top
![Page 37: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/37.jpg)
14 Feb. 2007 Highly Programmable Matter 37
Bottom
![Page 38: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/38.jpg)
14 Feb. 2007 Highly Programmable Matter 38
Remarks• More realistic procedure:
– Systematic placement of regions– Order of path growth– Control of diffusion & growth phases
• General approach is robust (many variationswork about as well)
• Paths could be formed by:– Migration of molecules etc.– Change of state of immobile molecules
![Page 39: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/39.jpg)
14 Feb. 2007 Highly Programmable Matter 39
Example Connection-Growth Process• Goal: approximately full interconnection between
incoming “axons” (A) and “dendrites” (D) of basisfunctions– Doesn’t have to be perfect
• Each A & D periodically initiates fiber growth– Growth is approximately away from source
• Fibers repel others of same kind– Diffusible, degradable repellant– Fibers follow decreasing gradient (in XZ plane)
• Contact formed when A and D fibers meet
![Page 40: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/40.jpg)
14 Feb. 2007 Highly Programmable Matter 40
Example of ConnectionFormation
• 10 random “axons”(red) and “dendrites”(blue)
• Simulation stoppedafter 100 connections(yellow) formed
![Page 41: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/41.jpg)
14 Feb. 2007 Highly Programmable Matter 41
Resulting Connections
![Page 42: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/42.jpg)
14 Feb. 2007 Highly Programmable Matter 42
Setting Connection Strengths by SVD• Let m×n connection matrix M = U Σ VT,
where
and Σr = diag (s1, …, sr)• Let uk and vk be columns of U and V:
U = [u1, …, um], V = [v1, …, vn]• Then,
• For each k, apply vk to input and uk to output andprogram with strength sk
!
M = skukvk
T
k=1
r
"
!
" ="r0
0 0
#
$ %
&
' (
![Page 43: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/43.jpg)
14 Feb. 2007 Highly Programmable Matter 43
Summary of U-Machine• Permits computation on quite general
abstract spaces (separable metric spaces)– Includes analog & digital computation
• Computation by linear combinations &simple nonlinear basis functions
• Simple computational medium can bereconfigured for different computations
• Potentially implementable in a variety ofmaterials
![Page 44: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/44.jpg)
14 Feb. 2007 Highly Programmable Matter 44
Highly Programmable Matter
![Page 45: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/45.jpg)
14 Feb. 2007 Highly Programmable Matter 45
Computational Control of Matter• A material process may be used as a
substrate for formal computation• Formal computation may be used to control
a material process• A material process may be a substrate for
universal computation, controlled by aformal program
• A formal program may be used to govern amaterial process
![Page 46: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/46.jpg)
14 Feb. 2007 Highly Programmable Matter 46
The Physical Stateas Synthetic Medium
• Computation controls physical state (assynthesis medium)
• Reconfigured computer is embodied inphysical state
• Computation must be able to distinguishsynthetically relevant physical states
![Page 47: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/47.jpg)
14 Feb. 2007 Highly Programmable Matter 47
Universal Computer
physicalstate
U(equations)
externalinput
synthesismedium
![Page 48: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/48.jpg)
14 Feb. 2007 Highly Programmable Matter 48
Initialization
Uexternalinput
d
δ
s
![Page 49: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/49.jpg)
14 Feb. 2007 Highly Programmable Matter 49
Computation
Uexternalinput
d′
s′
waste
energy
![Page 50: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/50.jpg)
14 Feb. 2007 Highly Programmable Matter 50
Completion
Uexternalinput
C
synthesizedcomputer
![Page 51: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/51.jpg)
14 Feb. 2007 Highly Programmable Matter 51
Equilibrium vs. StationaryConfigurations
• Program terminates for equilibrium config.• Program continues to run for stationary config.
UC
U
C′
waste
energy
input input′
d′ d′′
![Page 52: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/52.jpg)
14 Feb. 2007 Highly Programmable Matter 52
Thermodynamics of aConfiguration
• Either, configuration is a stable state– damage may shift to undesirable equilibrium
• Or, configuration is a stationary state of anon-equilibrium system– continuously reconfigures self– self-repair as return to original stationary state– adaptation & damage recovery as move to
different stationary state
![Page 53: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/53.jpg)
14 Feb. 2007 Highly Programmable Matter 53
Useful Media forComputational Synthesis
• For pure computation, move as little matter& energy as possible
• For synthesis, need to control atoms &molecules as well as electrons
• Need sufficiently wide variety ofcontrollable atoms & molecules
• Goal: structures on the order of opticalwavelengths (100s of nm)
![Page 54: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/54.jpg)
14 Feb. 2007 Highly Programmable Matter 54
Models of Computationfor Synthesis
• Need massive parallelism to control detailedorganization of state
• Need tolerance to errors in state– synthesis program should be tolerant– configured computer should be tolerant
![Page 55: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/55.jpg)
14 Feb. 2007 Highly Programmable Matter 55
Locus of Control ofDetailed Organization
• Reorganizing atoms & molecules⇒ vast amount of detailed control
• Heterosynthesis– external configuration controller determines
fine structure of medium (high bandwidth)• Autosynthesis
– external configuration controller determinesgeneral boundary conditions (low BW)
– fine structure results from self-organization
![Page 56: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/56.jpg)
14 Feb. 2007 Highly Programmable Matter 56
General Model ofRadical Reconfiguration
• Synthesis controller– low bandwidth to outside world– bandwidth to medium:
• high for heterosynthesis• low for autosynthesis
• Synthetic medium– molar parallelism of interactions
• simple for heterosynthesis• complex for autosynthesis
– what are suitable synthetic media?
![Page 57: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/57.jpg)
14 Feb. 2007 Highly Programmable Matter 57
Example:Activation-Inhibition System
• Let σ be the logistic sigmoid function• Activator A and inhibitor I may diffuse at
different rates in x and y directions• Cell is “on” if activator + bias exceeds
inhibitor
!
"A
"t= dAx
" 2A
"x 2+ dAy
" 2A
"y 2+ kA# mA A + B $ I( )[ ]
"I
"t= dIx
" 2I
"x 2+ dIy
" 2I
"y 2+ kI# mI A + B $ I( )[ ]
![Page 58: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/58.jpg)
14 Feb. 2007 Highly Programmable Matter 58
Double Activation-InhibitionSystem
• Two independently diffusing activation-inhibitionpairs
• May have different diffusion rates in X and Ydirections– In this example, I1y >> I1x and I2x >> I2y
• Colors in simulation:– green = system 1 active– red = system 2 active– yellow = both active– black = neither active
![Page 59: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/59.jpg)
14 Feb. 2007 Highly Programmable Matter 59
Formation of Pattern
• Random initial state• System stabilizes to
< 1% cell changes• Modest noise
(annealing noise)improves regularity
![Page 60: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/60.jpg)
14 Feb. 2007 Highly Programmable Matter 60
Stationary State
• System is beingcontinuallymaintained in astationary state
• Continuing change< 1%
![Page 61: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/61.jpg)
14 Feb. 2007 Highly Programmable Matter 61
Recovery from Damage
• Simulated damage• Damage destroys
activators & inhibitorsas well as structure
• System repairs self byreturning to stationarystate
• No explicit repairsignal
![Page 62: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/62.jpg)
14 Feb. 2007 Highly Programmable Matter 62
Reconfiguration:Orthogonal Structure
• Exchange inhibitordiffusion rates forsystems 1 & 2
• Vertical stripesbecome horizontal
• Horizontal stripesbecome vertical
• No explicitreconfiguration signal
![Page 63: Highly Programmable Matter & Generalized Computationweb.eecs.utk.edu/~bmaclenn/papers/UM Reconfig Talk.pdf · 14 Feb. 2007 Highly Programmable Matter 3 Our Ongoing Research in Radical](https://reader035.vdocuments.mx/reader035/viewer/2022070907/5f7c5aaa0fa9406af05fbb40/html5/thumbnails/63.jpg)
14 Feb. 2007 Highly Programmable Matter 63
Conclusions• Radical reconfiguration can be
accomplished by using computation tochange matter– external control of macrostructure– self-organization of microstructure
• A simple, flexible architecture can computeover a variety of abstract spaces (includinganalog & digital)