A. Church, An Unsolvable Problem of Elementary Number Theory, American Journal of Mathematics, vol.58, issue.2, pp.345-363, 1936.
DOI : 10.2307/2371045

J. Cocke and M. Minsky, Universality of Tag Systems with P = 2, Journal of the ACM, vol.11, issue.1, p.52, 1963.
DOI : 10.1145/321203.321206

J. Cocke and M. Minsky, Universality of Tag Systems with P = 2, Journal of the ACM, vol.11, issue.1, pp.15-20, 1964.
DOI : 10.1145/321203.321206

M. Cook, Universality in Elementary Cellular Automata, Complex Systems, vol.15, issue.1, pp.1-40, 2004.

M. Davis, The Undecidable Basic papers on undecidable propositions, unsolvable problems and computable functions, Dover publications, 1965.

M. Davis, Why Gödel didn't have Church's thesis, Information and Control, pp.3-24, 1982.

M. Davis, L. Emil, and . Post, His life and work, p.xi?xviii, 1994.

D. Mol and L. , Closing the circle: An analysis of Emil Post's early work., The Bulletin of Symbolic Logic, pp.267-289, 2006.

D. Mol and L. , Study of limits of solvability in tag systems, Machines, Computations, and Universality, Fifth International Conference, MCU 2007 Orléans, p.4664, 2007.

D. Mol and L. , Tag systems and Collatz-like functions, Theoretical Computer Science, vol.390, issue.1, pp.92-101, 2008.
DOI : 10.1016/j.tcs.2007.10.020

M. Margenstern, Frontier between decidability and undecidability: a survey, Theoretical Computer Science, vol.231, issue.2, pp.217-251, 2000.
DOI : 10.1016/S0304-3975(99)00102-4

S. J. Maslov and E. L. On, Post's 'Tag' Problem, pp.5-56, 1964.

M. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines, The Annals of Mathematics, vol.74, issue.3, pp.437-455, 1961.
DOI : 10.2307/1970290

M. Minsky, Size and structure of universal Turing machines using tag systems, Proceedings Symposia Pure Mathematics, pp.229-238, 1962.
DOI : 10.1090/pspum/005/0142452

E. L. Post, Formal Reductions of the General Combinatorial Decision Problem, American Journal of Mathematics, vol.65, issue.2, pp.197-215, 1943.
DOI : 10.2307/2371809

E. L. Post, Absolutely unsolvable problems and relatively undecidable propositions -Account of an anticipation, pp.340-433, 1965.

E. L. Post, Definability: The collected works of Emil L, 1994.

J. Stillwell, Emil Post and His Anticipation of G??del and Turing, Mathematics Magazine, vol.77, issue.1, pp.3-14, 2004.
DOI : 10.2307/3219226

A. M. Turing, On computable numbers with an application to the Entscheidungsproblem A correction to the paper was published in the same journal, Proceedings of the London Mathematical Society, pp.1936-1973, 1937.

H. Wang, Tag systems and lag systems, Mathematische Annalen, vol.4, issue.1, pp.65-74, 1963.
DOI : 10.1007/BF01343730

D. Woods and T. Neary, On the time complexity of 2-tag systems and small universal Turing machines, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006.
DOI : 10.1109/FOCS.2006.58

D. Woods and T. Neary, Small semi-weakly Universal Turing Machines, Machines, Computations, and Universality, Fifth International Conference, p.4664, 2007.