K. Appel and W. Haken, Every planar map is four colorable. part i. discharging The four color proof suffices, Illonois Journal of Mathematics Mathematical Intelligencer, vol.21, issue.8 1, pp.429-490, 1977.

K. Appel, W. Haken, and J. Koch, Every planar map is four colorable. part ii. reducibility, Illonois Journal of Mathematics, vol.21, pp.491-567, 1977.

K. Arkoudas and S. Bringsjord, Computer, justification and mathematical knowledge, Minds and Machines, pp.185-202, 2007.
DOI : 10.1007/s11023-007-9063-5

A. Baker, Experimental Mathematics, Erkenntnis, vol.76, issue.3, pp.331-344, 2008.
DOI : 10.1007/s10670-008-9109-y

J. Van-bendegem, The Collatz-conjecture. A case study in mathematical problem solving, Logic and Logical Philosophy, pp.7-23, 2005.

F. Frank and . Bonsall, A down-to-earth view of mathematics, The American Mathematical Monthly, vol.89, issue.1, pp.8-15, 1981.

J. Borwein, Implications of experimental mathematics for the philosophy of mathematics, Proof and other Dilemmas, Spectrum, pp.33-60, 2008.

J. Borwein and D. Bailey, Mathematics by Experiment. Plausible reasoning in the 21st century, AK Peters, 2003.

A. H. Brady, The conjectured highest scoring machines for Radó's ?(k) for the value k = 4, IEEE Transactions on Electronic Computers EC, vol.15, issue.5, pp.802-803, 1966.

T. Burge, Computer proof, apriori knowledge, and Other Minds. the sixth Philosophical Perspectives Lecture, Nous, Supplement: Philosophical Perspectives, Language, Mind and Ontology, vol.12, issue.32, pp.1-37, 1998.
DOI : 10.1093/acprof:oso/9780199672028.003.0013

S. Andreea and . Calude, The journey of the four colour theorem through time, The New Zealand Mathematics Magazine, vol.38, issue.3, pp.27-35, 2001.

L. Thiel, C. W. Lam, and S. Swiercz, The non-existence of finite projective planes of order 10, Canadian Journal of Mathematics, vol.41, pp.1117-1123, 1989.

M. Detlefsen and M. Luker, The Four-Color Theorem and Mathematical Proof, The Journal of Philosophy, vol.77, issue.12, pp.803-820, 1980.
DOI : 10.2307/2025806

B. Shalosh and . Ekhad, A very short proof of Dixon's theorem, Journal of combinatorial theory, Series A, pp.54-141, 1990.

G. Gonthier, A computer-checked proof of the Four Color Theorem, 2004.

C. Thomas and . Hales, A proof of the kepler conjecture, Annals of Mathematics, vol.162, issue.3, pp.1063-1183, 2005.

R. Paul and . Halmos, Has progress in Mathematics slowed down?, The American Mathematical Monthly, vol.97, issue.7, pp.561-588, 1990.

B. Van-kerkhove and J. Paul-van-bendegem, Pi on Earth, or Mathematics in the Real World, Erkenntnis, vol.40, issue.1, pp.421-435, 2008.
DOI : 10.1007/s10670-008-9102-5

R. J. Kopp, The busy beaver problem, Mathematical sciences, 1981.

I. Krakowski, The four color problem reconsidered, Philosophical Studies, vol.38, issue.1, pp.91-96, 1980.
DOI : 10.1007/BF00354531

W. H. Clement and . Lam, The Search for a Finite Projective Plane of Order 10, The American Mathematical Monthly, vol.98, issue.4, pp.305-318, 1991.

H. Derrick and . Lehmer, Some high-speed logic, Experimental Arithmetic, Proceedings of Symposia in Applied Mathematics, pp.141-376, 1963.

H. Derrick, E. Lehmer, W. H. Lehmer, J. L. Mills, and . Selfridge, Machine proof of a theorem on cubic residues, Mathematics of computation, vol.16, issue.80, pp.407-415, 1962.

M. Levin, On Tymoczko's argument for mathematical empiricism, Philosophical Studies, vol.39, issue.1, pp.79-86, 1981.
DOI : 10.1007/BF00354815

S. Lin and T. Radó, Computer Studies of Turing Machine Problems, Journal of the ACM, vol.12, issue.2, pp.196-212, 1965.
DOI : 10.1145/321264.321270

R. Machlin and Q. F. Stout, The complex behaviour of simple machines, Physica D, pp.42-85, 1990.

D. Mackenzie, Slaying the Kraken:, Social Studies of Science, vol.29, issue.1, pp.7-60, 1999.
DOI : 10.1177/030631299029001002

W. Mccune, Solution of the Robbins problem, Journal of Automated Reasoning, vol.19, issue.3, pp.263-276, 1997.
DOI : 10.1023/A:1005843212881

P. Michel, Small Turing machines and generalized busy beaver competition, Theoretical Computer Science, vol.326, issue.1-3, pp.45-56, 2004.
DOI : 10.1016/j.tcs.2004.05.008

URL : http://doi.org/10.1016/j.tcs.2004.05.008

M. Liesbeth-de, Study of fractals derived from IFS-fractals through metric procedures, Fractals, vol.13, issue.3, pp.237-244, 2005.

G. Polya, Mathematics and plausible reasoning, Induction and Analogy in Mathematics, vol.1, 1954.

T. Radó, On non-computable functions, The Bell System Technical Journal 41, pp.877-884, 1962.

N. Robertson, D. P. Sanders, P. Seymour, and R. Thomas, The Four-Colour Theorem, Journal of Combinatorial Theory, Series B, vol.70, issue.1, pp.2-44, 1997.
DOI : 10.1006/jctb.1997.1750

S. Seiden, A manifesto for the computational method, Theoretical Computer Science, vol.282, issue.2, pp.381-395, 1998.
DOI : 10.1016/S0304-3975(01)00078-0

G. Stuart and . Shanker, The Appel-Haken solution of the the four-color problem, Ludwig Wittgenstein: Critical Assessments, pp.395-412, 1986.

R. Edward and . Swart, The Philosophical Implications of the Four Color Problem, The American Mathematical Monthly, vol.87, pp.697-707, 1980.

T. Tymoczko, The Four-Color Problem and Its Philosophical Significance, The Journal of Philosophy, vol.76, issue.2, pp.57-83, 1979.
DOI : 10.2307/2025976

D. Zeilberger, Theorem for a price: Tomorrows semi-rigorous mathematical culture, Notices of the, pp.978-981, 1993.