{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T06:11:29Z","timestamp":1785737489679,"version":"3.56.0"},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"7","license":[{"start":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T00:00:00Z","timestamp":1415577600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2015,10]]},"abstract":"<jats:p>In this paper, we continue the study of the geometry of Brownian motions which are encoded by Kolmogorov\u2013Chaitin random reals (complex oscillations). We unfold Kolmogorov\u2013Chaitin complexity in the context of Brownian motion and specifically to phenomena emerging from the random geometric patterns generated by a Brownian motion.<\/jats:p>","DOI":"10.1017\/s0960129513000273","type":"journal-article","created":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T11:41:20Z","timestamp":1415619680000},"page":"1590-1606","source":"Crossref","is-referenced-by-count":3,"title":["Kolmogorov complexity and the geometry of Brownian motion"],"prefix":"10.1017","volume":"25","author":[{"given":"WILLEM L.","family":"FOUCH\u00c9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,11,10]]},"reference":[{"key":"S0960129513000273_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608858"},{"key":"S0960129513000273_ref23","doi-asserted-by":"publisher","DOI":"10.1214\/154957804100000042"},{"key":"S0960129513000273_ref22","volume-title":"Fourier Analysis on Groups","author":"Rudin","year":"1960"},{"key":"S0960129513000273_ref6","unstructured":"Fontes L. R. G. , Isopi M. , Newman C. M. and Ravishankar K. (2003) The Brownian web: Characterisation and convergence, available at arXiv:math.PR\/0304119v1."},{"key":"S0960129513000273_ref7","doi-asserted-by":"publisher","DOI":"10.2307\/2586546"},{"key":"S0960129513000273_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(66)80018-9"},{"key":"S0960129513000273_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0615-1"},{"key":"S0960129513000273_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12898-5"},{"key":"S0960129513000273_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129513000157"},{"key":"S0960129513000273_ref2","first-page":"21","article-title":"Use of the Kolmogorov complexity in analysing control system dynamics","volume":"47","author":"Asarin","year":"1986","journal-title":"Automation Remote Control"},{"key":"S0960129513000273_ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-2011-10741-X"},{"key":"S0960129513000273_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03073-4_22"},{"key":"S0960129513000273_ref24","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v11-309"},{"key":"S0960129513000273_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.009"},{"key":"S0960129513000273_ref1","volume-title":"Individual random signals: An approach based on complexity","author":"Asarin","year":"1988"},{"key":"S0960129513000273_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.045"},{"key":"S0960129513000273_ref3","unstructured":"Camia F. , Fontes L. R. G. and Newman C. M. (2005) The scaling limit geometry of near-critical 2D percolation, available at arXiv:cond-mat\/0510740v1."},{"key":"S0960129513000273_ref21","first-page":"1","article-title":"The rapid points of a complex oscillation","volume":"1","author":"Potgieter","year":"2012","journal-title":"Logical Methods in Computer Science"},{"key":"S0960129513000273_ref20","unstructured":"Peres Y. (2001) An Invitation to Sample Paths of Brownian Motion, available at www.stat.berkeley.edu\/peres\/bmall.pdf"},{"key":"S0960129513000273_ref14","doi-asserted-by":"publisher","DOI":"10.2307\/421088"},{"key":"S0960129513000273_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.12.010"},{"key":"S0960129513000273_ref8","doi-asserted-by":"publisher","DOI":"10.1006\/aima.2000.1945"},{"key":"S0960129513000273_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00298-9"},{"key":"S0960129513000273_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9"},{"key":"S0960129513000273_ref19","volume-title":"Computability and Randomness","author":"Nies","year":"2008"},{"key":"S0960129513000273_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.054"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129513000273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T18:59:38Z","timestamp":1555786778000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129513000273\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,10]]},"references-count":26,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["S0960129513000273"],"URL":"https:\/\/doi.org\/10.1017\/s0960129513000273","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,10]]}}}