 |
Business | Industries | Finance | Tax |
| Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|||||
| First Prev [ 1 2 ] Next Last |
The dynamic recurrent neural networks developed in his lab are simplified mathematical models of the biological feedback networks found in human brains. From training sequences they learn to solve numerous tasks unsolvable by previous such models. Applications range from automatic music composition to speech recognition, reinforcement learning and robotics in partially observable environments.
In 19971997 was a common year starting on Wednesday (see link for calendar), and was designated the International Year of the Reef''. Events January January 3 NBC's Today Show Bryant Gumbel signs off for the last time January 8 Mister Rogers receives a star on t Schmidhuber published a paper based on Konrad ZuseKonrad Zuse ( June 22, 1910 December 18, 1995) was a German engineer and computer pioneer. His greatest achievement was the completion of the first functional tape-stored-program-controlled computer, the Z3, in 1941. It is sometimes claimed that this is t´s assumption ( 1967Events January January 4 British motorboat racer Donald Campbell dies while attempting a water speed record in Coniston Lake. January 4 Algerian revolutionary Mohammed Khider is shot in Madrid. January 6 Vietnam War: USMC and ARVN troops launch " Operatio) that the history of the universe is computable. He pointed out that the simplest explanation of the universe would be a very simple Turing machineThe Turing machine is an abstract model of computer execution and storage introduced in 1936 by Alan Turing to give a mathematically precise definition of algorithm or 'mechanical procedure'. As such it is still widely used in theoretical computer science programmed to systematically execute all possible programs computing all possible histories for all types of computable physical laws. He also pointed out that there is an optimally efficient way of computing all computable universes based on Leonid LevinLeonid Levin (born 1948, USSR) was a computer scientist and a student of Andrey Kolmogorov. He emigrated to the USA in 1978. He is well known for his work in: randomness in computing; algorithmic complexity and intractability; foundations of mathematics a´s universal search algorithm ( 1973Events January events January 1 United Kingdom, Ireland, and Denmark enter the European Economic Community now known as the European Union January 3 Columbia Broadcasting System (CBS) sells the New York Yankees for $10 million to a 12-person syndicate led). In 2000This page is about the year 2000. See 2000 AD for the UK comic book, Number 2000 for other uses. 2000 is a leap year starting on Saturday (see link for calendar), and also the International Year for a Culture of Peace''. Events Y2K passes without the seri he expanded this work by combining Ray SolomonoffRay Solomonoff (born 1926) invented the concept of algorithmic probability around 1960. Take a universal computer and randomly generate an input program. The program will generate some possibly infinite output. The algorithmic probability of any given fin´s theory of inductive inference with the assumption that quickly computable universes are more likely than others. This work on digital physics also led to limit-computable generalizations of algorithmic information and the concept of Super Omegas, which are limit-computable numbers that are even more random (in a certain sense) than Gregory Chaitin´s number of wisdom Omega.
One ambitious theoretical and fanciful contribution is his 30-page preprint (2003) on the as yet unrealized Gödel machine which, we are told, would solve arbitrary computational problems in an optimal fashion inspired by Kurt Gödel's celebrated self-referential formulas (1931).
Schmidhuber's low-complexity artworks (since 1997) can be described by very short computer programs containing very few bits of information, and reflect his formal theory of beauty based on the concepts of Kolmogorov complexity and minimum description length.
Schmidhuber writes that since age 15 or so his main scientific ambition has been to build an optimal scientist, then retire. First he wants to build a scientist better than himself (he says his colleagues claim that should be easy) who will then do the remaining work. He claims he "cannot see any more efficient way of using and multiplying the little creativity he's got".
| Politics | Business | Finance |
 |
 |
 |