Information Technology Reference
In-Depth Information
Schmidhuber, J. (1992). Learning complex, extended sequences using the principle of history com-
pression.
Neural Computation
,
4
(2), 234-242.
Schmidhuber, J. (1997a). A computer scientist's view of life, the universe, and everything. In C.
Freksa, M. Jantzen & R. Valk (Eds.),
Lecture notes in computer science: Vol. 1337
.
Foundations
of computer science: potential—theory—cognition
(pp. 201-208). Berlin: Springer.
Schmidhuber, J. (1997b). Femmes fractales.
Schmidhuber, J. (1997c). Low-complexity art.
Leonardo, Journal of the International Society for
the Arts, Sciences, and Technology
,
30
(2), 97-103.
Schmidhuber, J. (1998).
Facial beauty and fractal geometry
(Technical report TR IDSIA-28-98).
IDSIA. Published in the Cogprint Archive.
http://cogprints.soton.ac.uk
.
Schmidhuber, J. (1999). Artificial curiosity based on discovering novel algorithmic predictability
through coevolution. In P. Angeline, Z. Michalewicz, M. Schoenauer, X. Yao & Z. Zalzala
(Eds.),
Congress on evolutionary computation
(pp. 1612-1618). New York: IEEE Press.
Schmidhuber, J. (2002a). Exploring the predictable. In A. Ghosh & S. Tsuitsui (Eds.),
Advances
in evolutionary computing
(pp. 579-612). Berlin: Springer.
Schmidhuber, J. (2002b). Hierarchies of generalized Kolmogorov complexities and nonenumer-
able universal measures computable in the limit.
International Journal of Foundations of Com-
puter Science
,
13
(4), 587-612.
Schmidhuber, J. (2002c). The speed prior: a new simplicity measure yielding near-optimal com-
putable predictions. In J. Kivinen & R. H. Sloan (Eds.),
Lecture notes in artificial intelligence
.
Proceedings of the 15th annual conference on computational learning theory (COLT 2002)
,
Sydney, Australia (pp. 216-228). Berlin: Springer.
Schmidhuber, J. (2004). Optimal ordered problem solver.
Machine Learning
,
54
, 211-254.
Schmidhuber, J. (2006a). Developmental robotics, optimal artificial curiosity, creativity, music,
and the fine arts.
Connection Science
,
18
(2), 173-187.
Schmidhuber, J. (2006b). Randomness in physics.
Nature
,
439
(3), 392. Correspondence.
Schmidhuber, J. (2007a). Alle berechenbaren universen (all computable universes).
Spektrum der
Wissenschaft Spezial (German edition of Scientific American)
,
3
, 75-79.
Schmidhuber, J. (2007b). Simple algorithmic principles of discovery, subjective beauty, selective
attention, curiosity & creativity. In
LNAI: Vol. 4755
.
Proc. 10th intl. conf. on discovery sci-
ence (DS 2007)
(pp. 26-38). Berlin: Springer. Joint invited lecture for ALT 2007 and DS 2007,
Sendai, Japan, 2007.
Schmidhuber, J. (2009a). Art & science as by-products of the search for novel patterns, or data
compressible in unknown yet learnable ways. In M. Botta (Ed.),
Multiple ways to design re-
search. Research cases that reshape the design discipline
(pp. 98-112). Berlin: Springer. Swiss
design network—et al. Edizioni.
Schmidhuber, J. (2009b). Driven by compression progress: a simple principle explains essential
aspects of subjective beauty, novelty, surprise, interestingness, attention, curiosity, creativity,
art, science, music, jokes. In G. Pezzulo, M. V. Butz, O. Sigaud & G. Baldassarre (Eds.),
Lecture
notes in computer science: Vol. 5499
.
Anticipatory behavior in adaptive learning systems. From
psychological theories to artificial cognitive systems
(pp. 48-76). Berlin: Springer.
Schmidhuber, J. (2009c). Simple algorithmic theory of subjective beauty, novelty, surprise, inter-
estingness, attention, curiosity, creativity, art, science, music, jokes.
SICE Journal of the Society
of Instrument and Control Engineers
,
48
(1), 21-32.
Schmidhuber, J. (2009d). Ultimate cognition
àla
Gödel.
Cognitive Computation
,
1
(2), 177-193.
Schmidhuber, J. (2010). Formal theory of creativity, fun, and intrinsic motivation (1990-2010).
IEEE Transactions on Autonomous Mental Development
,
2
(3), 230-247.
Schmidhuber, J., & Heil, S. (1996). Sequential neural text compression.
IEEE Transactions on
Neural Networks
,
7
(1), 142-146.
Schmidhuber, J., Zhao, J., & Wiering, M. (1997). Shifting inductive bias with success-story algo-
rithm, adaptive Levin search, and incremental self-improvement.
Machine Learning
,
28
, 105-
130.
Shannon, C. E. (1948). A mathematical theory of communication (parts I and II).
Bell System
Technical Journal
,
XXVII
, 379-423.
