Formal methods | Computer-assisted proofs | Automated theorem proving | Numerical analysis | Philosophy of mathematics

Computer-assisted proof

A computer-assisted proof is a mathematical proof that has been at least partially generated by computer. Most computer-aided proofs to date have been implementations of large proofs-by-exhaustion of a mathematical theorem. The idea is to use a computer program to perform lengthy computations, and to provide a proof that the result of these computations implies the given theorem. In 1976, the four color theorem was the first major theorem to be verified using a computer program. Attempts have also been made in the area of artificial intelligence research to create smaller, explicit, new proofs of mathematical theorems from the bottom up using automated reasoning techniques such as heuristic search. Such automated theorem provers have proved a number of new results and found new proofs for known theorems. Additionally, interactive proof assistants allow mathematicians to develop human-readable proofs which are nonetheless formally verified for correctness. Since these proofs are generally human-surveyable (albeit with difficulty, as with the proof of the Robbins conjecture) they do not share the controversial implications of computer-aided proofs-by-exhaustion. (Wikipedia).

Video thumbnail

Johnathan Hanke - Computer-Assisted Proofs in the Arithmetic of Quadratic Forms - IPAM at UCLA

Recorded 17 February 2023. Johnathan Hanke of Princeton University presents "Computer-Assisted Proofs in the Arithmetic of Quadratic Forms" at IPAM's Machine Assisted Proofs Workshop. Abstract: Since its early history, the ideas and results in arithmetic of quadratic forms have been inspir

From playlist 2023 Machine Assisted Proofs Workshop

Video thumbnail

Introduction to Direct Proofs: If n is even, then n squared is even

This video introduces the mathematical proof method of direct proof provides an example of a direct proof. mathispower4u.com

From playlist Symbolic Logic and Proofs (Discrete Math)

Video thumbnail

Advice on learning mathematical proofs -- How to do Mathematical Proofs (PART 10)

Advice on learning mathematical proofs -- This is the final video on a series of videos on: How to do mathematical proofs. The course is structured in such a way to make the transition from applied-style problems in mathematics (sometimes referred to as engineering mathematics) to pure mat

From playlist How to do Mathematical Proofs

Video thumbnail

How to do mathematical proofs -- Introduction to Mathematical Proofs (PART 1)

This is the introductory video on a series of videos: How to do mathematical proofs. The course is structured in such a way to make the transition from applied-style problems in mathematics (sometimes referred to as engineering mathematics) to pure mathematics much smoother. The course w

From playlist How to do Mathematical Proofs

Video thumbnail

Methods of Proof | A-level Mathematics

The four main types of proof you need to be familiar with in A-level mathematics: - proof by deduction - proof by exhaustion - proof by counter-example - proof by contradiction ❤️ ❤️ ❤️ Support the channel ❤️ ❤️ ❤️ https://www.youtube.com/channel/UCf89Gd0FuNUdWv8FlSS7lqQ/join 100 g

From playlist A-level Mathematics Revision

Video thumbnail

Basic Methods of Proof -- How to do mathematical proofs (PART 5)

This is the third video on a series of videos on: How to do mathematical proofs. The course is structured in such a way to make the transition from applied-style problems in mathematics (sometimes referred to as engineering mathematics) to pure mathematics much smoother. In this video, w

From playlist How to do Mathematical Proofs

Video thumbnail

Introduction to Indirect Proof

This video introduces indirect proof and proves one basic algebraic and one basic geometric indirect proof. Complete Video List: http://mathispower4u.yolasite.com/

From playlist Relationships with Triangles

Video thumbnail

Examples of Proof by Contradiction -- How to do Mathematical Proofs (PART 7)

This is the fifth video on a series of videos on: How to do mathematical proofs. The course is structured in such a way to make the transition from applied-style problems in mathematics (sometimes referred to as engineering mathematics) to pure mathematics much smoother. The course will

From playlist How to do Mathematical Proofs

Video thumbnail

Math Talk! Dr. Andrej Bauer on proof assistants, constructive mathematics, philosophy, and more.

In this wonderful discussion with Dr. Andrej Bauer we discuss a whole host of topics centering around constructive mathematics, and proof assistants. Support Ukraine through Shtab Dobra: Instagram: https://www.instagram.com/shtab.dobra/ Facebook: https://www.facebook.com/shtab.dobra PayPa

From playlist Math Talk!

Video thumbnail

Andrej Bauer - Formalizing invisible mathematics - IPAM at UCLA

Recorded 13 February 2023. Andrej Bauer of the University of Ljubljana presents "Formalizing invisible mathematics" at IPAM's Machine Assisted Proofs Workshop. Abstract: It has often been said that all of mathematics can in principle be formalized in a suitably chosen foundation, such as f

From playlist 2023 Machine Assisted Proofs Workshop

Video thumbnail

10/25/19, Fabian Immler

Fabian Immler, Carnegie Mellon University Formal mathematics and a proof of chaos Formal proof has been successfully applied to the verification of hardware and software systems. But formal proof is also applicable to mathematics: proofs can be checked with ultimate rigor and one can bui

From playlist Fall 2019 Kolchin Seminar in Differential Algebra

Video thumbnail

4 - Kick-off afternoon : Xavier Leroy, Proof assistants in computer science research

J'ai créé cette vidéo à l'aide de l'application de montage de vidéos YouTube (http://www.youtube.com/editor).

From playlist T2-2014 : Semantics of proofs and certified mathematics

Video thumbnail

Patrick Massot - Why Explain Mathematics to Computers?

A growing number of mathematicians are having fun explaining mathematics to computers using proof assistant softwares. This process is called formalization. In this talk, I'll describe what formalization looks like, what kind of things it teaches us, and how it could even turn out to be us

From playlist Mikefest: A conference in honor of Michael Douglas' 60th birthday

Video thumbnail

Patrick Massot - Formalisation mathématique et types dépendants : Le point vue d'un (...)

Dans cet exposé je passerai en revue les surprises bonnes et moins bonnes je j'ai rencontrées en formalisant des mathématiques modernes en théorie des types dépendants. Patrick Massot (LMO, Université Paris-Saclay)

From playlist Workshop Schlumberger 2022 : types dépendants et formalisation des mathématiques

Video thumbnail

Introduction to the Coq Proof Assistant - Andrew Appel

Introduction to the Coq Proof Assistant - Andrew Appel Princeton University December 7, 2010 A "proof assistant" is a software package comprising a validity checker for proofs in a particular logic, accompanied by semi-decision procedures called "tactics" that assist the mathematician in

From playlist Mathematics

Video thumbnail

Mathematical Notations -- How to do mathematical proofs (PART 2)

This video contains the preliminary mathematical notation that will be used in the course. This is preliminary video (part 0) on a series of videos: How to do mathematical proofs. The course is structured in such a way to make the transition from applied-style problems in mathematics (som

From playlist How to do Mathematical Proofs

Video thumbnail

History of Science and Technology Q&A (June 1, 2022)

Stephen Wolfram hosts a live and unscripted Ask Me Anything about the history of science and technology for all ages. Find the playlist of Q&A's here: https://wolfr.am/youtube-sw-qa Originally livestreamed at: https://twitch.tv/stephen_wolfram If you missed the original livestream of

From playlist Stephen Wolfram Ask Me Anything About Science & Technology

Video thumbnail

Univalence from a computer science point-of-view - Dan Licata

Vladimir Voevodsky Memorial Conference Topic: Univalence from a computer science point-of-view Speaker: Dan Licata Affiliation: Wesleyan University Date: September 14, 2018 For more video please visit http://video.ias.edu

From playlist Mathematics

Related pages

Proof assistant | Schur's theorem | Theorem | Logic Theorist | Automorphism group of a free group | Sudoku | Kazhdan's property (T) | Observational study | Formal verification | Mathematical proof | Metamath | Connect Four | Erdős discrepancy problem | Proof by exhaustion | Seventeen or Bust | Quasi-empiricism in mathematics | Heuristic (computer science) | Artificial intelligence | Smale's problems | Non-surveyable proof | Minimum-weight triangulation | Gigabyte | Mitchell Feigenbaum | Kepler conjecture | DPLL algorithm | Boolean Pythagorean triples problem | Model checking | Automated reasoning | Four color theorem | Validated numerics | Experimental mathematics | Keller's conjecture | Projective plane | Van der Waerden number | Interval arithmetic | Optimal solutions for Rubik's Cube