| . |
"OHM
OR DO PRIESTS DREAM ELECTRIC SHEEP?":
By Madí Verdún (pour: "Imaginari Tecnològic Contemporani
(I)" by prof. Joaquim Dols and "Theory of electronic arts" by
prof. Job Ramos (Ub) 2005)
Last update: 17/03/06
(coments:
- This is a practicable visual inventory throught
mixed historical relational-representation documents.
- The simbol "
"
is linking to wikipedia related subjects.
- Some of the images link to related web sites
|
|
|
this is the printed version, an entertaining desktop
sculpture ideal for waiting rooms. teomporary unavalible.
)
|
 |
 |
||||
 |
|
    |
  |
 |
 |
|
|
|||
|
|
 |
| 1736Seven Bridges of Königsberg | |||
| "One of the
first results in graph theory appeared in Leonhard Euler's paper on Seven Bridges of Königsberg, published in 1736. It is also regarded as one of the first topological results in geometry; that is, it does not depend on any measurements. This illustrates the deep connection between graph theory and topology." http://en.wikipedia.org/wiki/Graph_theory
|
|
|
  to maths imagery
|
 ABOUT
AMPÈRE, OHM,VOLTA,FARADAY,
COULOMB, KRITCHOFF...  ,     
 
|
|
|
 
|
  |
1843 Ada Byron, Lady Lovelace (1815-1852), daughter of Lord Byron and (romantically) author of the first computer program. She writed a translation of, and Notes to, Luigi F. Menabrea's. " Sketch of the analytical engine invented by Charles Babbage, Esq." (1842/1843) (Christopher D. Green, 2000) http://psychclassics.yorku.ca/ 1840? Charles Babbage's Differential Engine – (romantically) the first compute “By 1820, apparently frustrated with the errors he found in the published mathematical tables of the day, Babbage developed a design for a machine that would calculate and print them flawlessly. He called the machine the "Difference Engine" because it depended on a procedure known as the "method of differences" for its calculations. (...) By 1833, however, Babbage had come up idea for a radically new machine, one that could calculate and print the result of any function at all, not just those reducible to the method of differences. In 1836 he hit upon the idea that the operation of this new machine could be controlled by having it "read" instructions coded into punched cards, like those used in the automatic loom that had been built by Joseph-Marie Jacquard in France in 1801. He called the new machine the "Analytical Engine." (...)” (Christopher D. Green, 2000) http://psychclassics.yorku.ca/   .....
|
|
|
“The Four
Color Problem dates back to 1852
when Francis Guthrie, while trying to color the map of counties of
England noticed that four colors sufficed. He asked his brother Frederick
if it was true that any map can be colored using four colors in such
a way that adjacent regions (i.e. those sharing a common boundary
segment, not just a point) receive different colors. The conjecture was first proposed in 1852 when Francis Guthrie, while trying to color the map of counties of England, noticed that only four different colors were needed. At the time, Guthrie was a student of Augustus De Morgan at University College. (Guthrie graduated in 1850, and later became a professor of mathematics in South Africa). According to de Morgan: A student of mine [Guthrie] asked me today to give him a reason for a fact which I did not know was a fact - and do not yet. He says that if a figure be anyhow divided and the compartments differently coloured so that figures with any portion of common boundary line are differently coloured - four colours may be wanted, but not more - the following is the case in which four colours are wanted. Query cannot a necessity for five or more be invented... The first published reference is found in Arthur Cayley's, On the colourings of maps., Proc. Royal Geography Society 1, 259-261, 1879. There were several early failed attempts at proving the theorem. One proof of the theorem was given by Alfred Kempe in 1879, which was widely acclaimed; another proof was given by Peter Tait in 1880. It wasn't until 1890 that Kempe's proof was shown incorrect by Percy Heawood, and 1891 that Tait's proof was shown incorrect by Julius Petersen - each false proof stood unchallenged for 11 years. In 1890, in addition to exposing the flaw in Kempe's proof, Heawood proved that all planar graphs are five-colorable; see five color theorem. Significant results were produced by Croatian mathematician Danilo Blanuša in the 1940s by finding an original snark. During the 1960s and 1970s German mathematician Heinrich Heesch developed methods of applying the computer in searching for a proof. In 1969 British mathematician G. Spencer-Brown claimed that the theorem could be proven with mathematics he had developed. However, he was never able to produce a proof. It was not until 1976 that the four-color conjecture was finally proven by Kenneth Appel and Wolfgang Haken at the University of Illinois. They were assisted in some algorithmic work by J. Koch. In 1969 British mathematician G. Spencer-Brown claimed that the theorem could be proven with mathematics he had developed. However, he was never able to produce a proof. It was not until 1976 that the four-color conjecture was finally proven by Kenneth Appel and Wolfgang Haken at the University of Illinois. They were assisted in some algorithmic work by J. Koch." http://en.wikipedia.org/wiki/Four_color_problema |
|
 biobio
|
| (SantiagoRamon
y Cajal) Cajal neuron imagery |
 |
|
 |
 |
 |
 |
|
|
Brain
(later) |
|
(psico) cognitive imagery |
   
 |
From "very early computer imagery" |
   .
 . 
 
 
.  . 
. 
|
|
1960
1960
1969
.   |
The pioneering research of Paul Baran in the 1960s, who envisioned a communications network that would survive a major enemy attacked. The sketch shows three different network topologies described in his RAND Memorandum, "On Distributed Communications: 1. Introduction to Distributed Communications Network" (August 1964). The distributed network structure offered the best survivability | “A rough
sketch map of the possible topology of ARPANET by Larry Roberts. The
map was drawn in the late 1960s
as part of the planning for the network. (Scanned from Where Wizards Stay Up Late: The Origins of the Internet, by Katie Hafner and Matthew Lyon, page 50.)” |
“The
first node on ARPANET at University California Los Angeles (UCLA)
on the 2nd of September 1969. (Source : "Casting the Net", page 55)”
|
|
  (http://www.opte.org/, and more like this at http://www.visualcomplexity.com ) |
  |
 
|
|
     |
  
  |
 From
“Wilkins, Peirce, Borges, Taxonomy,
chomsky,...”language as network |
|||
   
 
|
|||
    |
To “constructed
languages" 
  
¡ |
||
(the
hiden strike)
 
|
 |
 |
 |
art world(ish) network imagery
(Mark
Lombardi)  
 |
 |
 
 |
/
1909
FROM the “very early
New age imagery”(?)back
to 1960s
(popular psicology coctail
imagery)
FROM
the “not that early
New age imagery”
 
|
“Engrams,
then; are perceptual recordings made when the analytical mind is turned
off in a manner associated with pain or painful emotion”L.Ron
Hubbard |
   
 /
|
| “People
have been using image centred radial graphic organizers referred to
variably as mental or generic mind maps for centuries in areas such
as engineering, psychology, and education, although the claim to the
origin of the mind map has been made by a British popular psychology
author, Tony Buzan.
He claimed the idea was inspired by the general
semantics of science
fiction novels, such
as those of A. E. van Vogt and L.
Ron Hubbard” http://en.wikipedia.org/wiki/Mindmapping (Semantic Networks: )
|
|
educational
sight?(is that practice?)
"Ohm or
do priests dream electric sheep?":By Madí Verdún (pour: "Imaginari Tecnològic Contemporani (I)" by prof. Joaquim Dols and "Theory of electronic arts" by prof. Job Ramos (Ub) 2005)
| . |
(back
to
)