Frases de Doron Zeilberger

Doron Zeilberger é um matemático conhecido pelo seu trabalho na área de combinatória.

Doutorado pelo Instituto Weizmann da Ciência em 1976, sob a orientaçao de Harry Dym; é actualmente professor Board of Governors de Matemática na Universidade Rutgers.

Zeilberger efectuou inúmeras contribuições importantes em combinatória, igualdades hipergeométricas e séries-q.

Encontrou a primeira demonstração para a conjectura da matriz de sinal alternante, notável não só pelo seu conteúdo matemático, como também pelo facto de Zeilberger ter recrutado cerca de uma centena de voluntários para pré-confirmar o artigo.

Em conjunto com Herbert Wilf, recebeu em 1998 o Prêmio Leroy P. Steele da American Mathematical Society pelo desenvolvimento da teoria WZ, que revolucionou a área das séries hipergeométricas. Em 2004, recebeu a Medalha Euler; a citação do prémio refere Zeilberger como um "campeão do uso de computadores e algoritmos, em fazer matemática rápida e eficazmente".

Em 2011, em conjunto com Manuel Kauers e Christoph Koutschan, demonstrou a conjectura q-TSPP, criada indepentemente por George Andrews e David P. Robbins, em 1983.

Zeilberger considera-se um ultrafinitista. É também conhecido por reconhecer o seu computer "Shalosh B. Ekhad" como um co-autor , e pelos suas opiniões fortes e provocantes, entre as quais:



"The Shocking State of Contemporary "Mathematics", and the Meta-Shocking Fact that Very Few People Are Shocked"

"People who believe that applied math is bad math are bad mathematicians"

"Guess what? Programming is even more fun than proving, and, more importantly it gives as much, if not more, insight and understanding"

"Frank Quinn's rigor is not as rigorous as he thinks"

"Still like that old-time blackboard talk"





== Referências == Wikipedia  

✵ 2. Julho 1950
Doron Zeilberger photo
Doron Zeilberger: 11   citações 0   Curtidas

Doron Zeilberger: Frases em inglês

“Math is perfect (in principle), but mathematicians are not (because they are humans)”

Computerized Deconstruction. Appeared in Adv. Appl. Math. v. 31 (2003), 532-543.
Contexto: Math is perfect (in principle), but mathematicians are not (because they are humans), hence the mathematics that (human) mathematicians do is influenced by the weltanschauung of the people around them.

“Algorithms existed for at least five thousand years, but people did not know that they were algorithmizing.”

An Enquiry Concerning Human (and Computer!) [Mathematical] Understanding C.S. Calude, ed., "Randomness & Complexity, from Leibniz to Chaitin", World Scientific, Singapore, (October 2007)
Contexto: Algorithms existed for at least five thousand years, but people did not know that they were algorithmizing. Then came Turing (and Post and Church and Markov and others) and formalized the notion.

“Conventional wisdom, fooled by our misleading "physical intuition", is that the real world is continuous, and that discrete models are necessary evils for approximating the "real" world, due to the innate discreteness of the digital computer.”

"Real" Analysis is a Degenerate Case of Discrete Analysis. Appeared in the book "New Progress in Difference Equations"(Proc. ICDEA 2001), edited by Bernd Aulbach, Saber Elaydi, and Gerry Ladas, and publisher by Taylor & Francis, London, 2004.

“Regardless of whether or not God exists, God has no place in mathematics, at least in my book.”

An Enquiry Concerning Human (and Computer!) [Mathematical] Understanding C.S. Calude, ed., "Randomness & Complexity, from Leibniz to Chaitin", World Scientific, Singapore, (October 2007)

“Programming is much much harder than doing mathematics.”

The Narrow-Minded and Ignorant Referee's Report [and Zeilberger's Response] of Zeilberger's Paper "Automaric CounTilings" that was rejected by Helene Barcelo and the Members of the Advisory Board [that includes(!) Enumeration Expert Mireille Bousquet-Melou] of the Journal of Combinatorial Theory-Series A.

“Mathematics my foot! Algorithms are mathematics too, and often more interesting and definitely more useful.”

The Narrow-Minded and Ignorant Referee's Report [and Zeilberger's Response] of Zeilberger's Paper "Automaric CounTilings" that was rejected by Helene Barcelo and the Members of the Advisory Board [that includes(!) Enumeration Expert Mireille Bousquet-Melou] of the Journal of Combinatorial Theory-Series A. http://www.math.rutgers.edu/~zeilberg/RefTipesh.html

“The best way to learn a topic is by teaching it. Similarly the best way to understand a new proof is by writing an expository article about it.”

[Kathy O'Hara's constructive proof of the unimodality of the Gaussian polynomials, Amer. Math. Monthly, 96, 1989, 592 of 590–602, http://www.maa.org/programs/maa-awards/writing-awards/kathy-oharas-constructive-proof-of-the-unimodality-of-the-gaussian-polynomials]