Randomness on Full Shift Spaces

Calude, C.S; Hertling, P; Juergensen, H; Weihrauch, K

dc.contributor.author	Calude, C.S	en
dc.contributor.author	Hertling, P	en
dc.contributor.author	Juergensen, H	en
dc.contributor.author	Weihrauch, K	en
dc.date.accessioned	2009-04-16T23:18:01Z	en
dc.date.available	2009-04-16T23:18:01Z	en
dc.date.issued	1999-04	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-100 (1999)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3609	en
dc.description.abstract	We give various characterizations for algorithmically random configurations on full shift spaces, based on randomness tests. We show that all nonsurjective cellular au- tomata destroy randomness and surjective cellular automata preserve randomness. Fur- thermore all one-dimensional cellular automata preserve nonrandomness. The last three assertions are also true if one replaces randomness by richness,\|a form of pseudoran- domness, which is compatible with computability, the last assertion even for an arbitrary dimension.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Randomness on Full Shift Spaces	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en