Probabilistic L-systems can look like the branches of plants and trees

Complexity 17 (4):5-7 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the spectra of cardinalities of branches of Kurepa trees.Márk Poór - 2021 - Archive for Mathematical Logic 60 (7):927-966.
Computational complexity reduction and interpretability improvement of distance-based decision trees.Marcin Blachnik & Mirosław Kordos - 2012 - In Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michał Woźniak, Manuel Grana & Sung-Bae Cho (eds.), Hybrid Artificial Intelligent Systems. Springer. pp. 288--297.
Probability Out Of Determinism.Michael Strevens - 2011 - In Claus Beisbart & Stephan Hartmann (eds.), Probabilities in Physics. Oxford, GB: Oxford University Press. pp. 339--364.
Undefinability of κ-well-orderings in l∞κ.Juha Oikkonen - 1997 - Journal of Symbolic Logic 62 (3):999 - 1020.

Analytics

Added to PP
2013-10-30

Downloads
79 (#206,241)

6 months
79 (#72,218)

Historical graph of downloads
How can I increase my downloads?