Say that I will use DDS with T = N.
I don't want to mess with negative time and whatever that may imply.
This commit is contained in:
parent
ce6895072f
commit
6b269cdf8c
1 changed files with 3 additions and 2 deletions
5
deal.tex
5
deal.tex
|
@ -551,8 +551,9 @@ the iteration of $F$: $\{F^k(s) \mid k \in \mathbb{N}\}$, where
|
||||||
$F^0(s) = s$, $F^1(s) = F(s)$, $F^2(s) = F(F(s))$, etc.
|
$F^0(s) = s$, $F^1(s) = F(s)$, $F^2(s) = F(F(s))$, etc.
|
||||||
|
|
||||||
While I will give most of the general definitions for abstract
|
While I will give most of the general definitions for abstract
|
||||||
dynamical systems, I will rely on discrete-time dynamical systems
|
dynamical systems, I will rely on discrete-time dynamical systems with
|
||||||
later on in the manuscript, for the following reasons:
|
$T = \mathbb{N}$ later on in the manuscript, for the following
|
||||||
|
reasons:
|
||||||
\begin{enumerate}
|
\begin{enumerate}
|
||||||
\item discrete time yields simpler formal systems, which can capture
|
\item discrete time yields simpler formal systems, which can capture
|
||||||
a wider range of features before becoming too complex to comprehend,
|
a wider range of features before becoming too complex to comprehend,
|
||||||
|
|
Loading…
Reference in a new issue