<s>
The	O
Tinkerbell	B-Algorithm
map	I-Algorithm
is	O
a	O
discrete-time	O
dynamical	O
system	O
given	O
by	O
:	O
</s>
<s>
Like	O
all	O
chaotic	O
maps	O
,	O
the	O
Tinkerbell	B-Algorithm
Map	I-Algorithm
has	O
also	O
been	O
shown	O
to	O
have	O
periods	O
;	O
after	O
a	O
certain	O
number	O
of	O
mapping	O
iterations	O
any	O
given	O
point	O
shown	O
in	O
the	O
map	O
to	O
the	O
right	O
will	O
find	O
itself	O
once	O
again	O
at	O
its	O
starting	O
location	O
.	O
</s>
