(such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any single-taped Turing machine.
Chapter) http:/ /www.boostpro.com/mplbook/preprocessor.html Stack Overflow on X Macros: http:/ /bit.ly/15ZXZpt Dr Dobbs Journal http:/ /www.drdobbs.com/cpp/the-x-macro/228700289