Measuring static complexity.
International Journal of Mathematics and Mathematical Sciences (1992)
- Volume: 15, Issue: 1, page 161-174
- ISSN: 0161-1712
Access Full Article
top
How to cite
topGoertzel, Ben. "Measuring static complexity.." International Journal of Mathematics and Mathematical Sciences 15.1 (1992): 161-174. <http://eudml.org/doc/46671>.
@article{Goertzel1992,
author = {Goertzel, Ben},
journal = {International Journal of Mathematics and Mathematical Sciences},
keywords = {Kolmogorov complexity; algorithmic information; pattern; depth; sophistication; structure},
language = {eng},
number = {1},
pages = {161-174},
publisher = {Hindawi Publishing Corporation, New York},
title = {Measuring static complexity.},
url = {http://eudml.org/doc/46671},
volume = {15},
year = {1992},
}
TY - JOUR
AU - Goertzel, Ben
TI - Measuring static complexity.
JO - International Journal of Mathematics and Mathematical Sciences
PY - 1992
PB - Hindawi Publishing Corporation, New York
VL - 15
IS - 1
SP - 161
EP - 174
LA - eng
KW - Kolmogorov complexity; algorithmic information; pattern; depth; sophistication; structure
UR - http://eudml.org/doc/46671
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.