BTW, this is neat: http://arxiv.org/PS_cache/arxiv/pdf/0804/0804.3678v1.pdf

It's an attempt to better unify causal graphs with algorithmic information. The sections about various Markov properties is I think very important for explaining differences between CDT and TDT, 'cuz you can talk more clearly about exactly where a decision problem can't be solved due to Markov condition limitations.