In his 1948 paper Turing defined two examples of his unorganized machines. The first were A-type machines — these being essentially randomly connected networks of NAND logic gates. The second were called B-type machines, which could be created by taking an A-type machine and replacing every inter-node connection with a structure called a connection modifier — which itself is made from A-type nodes. The purpose of the connection modifiers were to allow the B-type machine to undergo "appropriate interference, mimicking education" in order to organize the behaviour of the network to perform useful work. Before the term genetic algorithm was coined, Turing even proposed the use of what he called a genetical search to configure his unorganized machines. Turing claimed that the behaviour of B-type machines could be very complex when the number of nodes in the network was large, and stated that the "picture of the cortex as an unorganized machine is very satisfactory from the point of view of evolution and genetics".
http://www.q2cfestival.com/play.php?lecture_id=7739
ReplyDeleteThe universe is old and energent in enternity .
ReplyDeleteInternet has a beginning and en end sometimes.
sometimes?
ReplyDeletefrom here to internity
ReplyDeletehttp://www.antifono.gr/portal/%CE%9A%CE%B1%CF%84%CE%B7%CE%B3%CE%BF%CF%81%CE%AF%CE%B5%CF%82/%CE%9A%CE%BF%CF%83%CE%BC%CE%BF%CE%BB%CE%BF%CE%B3%CE%AF%CE%B1-%CE%94%CE%B9%CE%B1%CE%B4%CE%AF%CE%BA%CF%84%CF%85%CE%BF-%CE%A7%CE%AC%CE%BF%CF%82/%CE%86%CF%81%CE%B8%CF%81%CE%B1/2963-%CE%A0%CE%B5%CF%81%CE%AF-%CE%A3%CF%8D%CE%B3%CF%87%CF%81%CE%BF%CE%BD%CE%B7%CF%82-%CE%93%CE%B5%CF%89%CE%BC%CE%B5%CF%84%CF%81%CE%AF%CE%B1%CF%82.html
ReplyDeleteμιγαδικοί/τοπολογία
citizen of a state of emergencies
ReplyDeletehttp://www.physics4u.gr/blog/?p=3858
ReplyDeletehttp://en.wikipedia.org/wiki/Echelon_%28signals_intelligence%29
http://scholar.google.gr/scholar?q=echelon+signal+patterns&hl=el&as_sdt=0&as_vis=1&oi=scholart
http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=265792
http://en.wikipedia.org/wiki/Unorganized_machine
ReplyDeleteIn his 1948 paper Turing defined two examples of his unorganized machines. The first were A-type machines — these being essentially randomly connected networks of NAND logic gates. The second were called B-type machines, which could be created by taking an A-type machine and replacing every inter-node connection with a structure called a connection modifier — which itself is made from A-type nodes. The purpose of the connection modifiers were to allow the B-type machine to undergo "appropriate interference, mimicking education" in order to organize the behaviour of the network to perform useful work. Before the term genetic algorithm was coined, Turing even proposed the use of what he called a genetical search to configure his unorganized machines. Turing claimed that the behaviour of B-type machines could be very complex when the number of nodes in the network was large, and stated that the "picture of the cortex as an unorganized machine is very satisfactory from the point of view of evolution and genetics".