Artificial intelligence and inherent mathematical difficulty
From MaRDI portal
Cites work
- A formal proof of the Kepler conjecture
- A Machine-Oriented Logic Based on the Resolution Principle
- A mathematical benchmark for inductive theorem provers
- A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
- Advancing mathematics by guiding human intuition with AI
- Alien coding
- An Elementary Problem Equivalent to the Riemann Hypothesis
- An improved proof procedure1
- Automated deduction in von Neumann-Bernays-Gödel set theory
- Automated reasoning for mathematics
- Automation compels mathematicians to reflect on our values
- Complexity of Boolean algebras
- Computational complexity theory and the philosophy of mathematics
- David Hilbert's Lectures on the Foundations of Arithmetic and Logic 1917-1933
- Equivalents of the Riemann Hypothesis
- Every planar map is four colorable. I: Discharging
- Existence and feasibility in arithmetic
- Extensions of generalized product caps
- Extensions of some theorems of Gödel and Church.
- Formal proof - the four color theorem
- Gelöste und ungelöste Probleme aus der Theorie der Primzahlverteilung und der \textit{Riemann}schen Zetafunktion.
- Grundzüge der theoretischen Logik.
- Hammering towards QED
- Handbook of satisfiability. In 2 parts
- Heuristic Problem Solving: The Next Advance in Operations Research
- scientific article; zbMATH DE number 2127501 (Why is no real title available?)
- scientific article; zbMATH DE number 5552087 (Why is no real title available?)
- scientific article; zbMATH DE number 3728250 (Why is no real title available?)
- scientific article; zbMATH DE number 3464843 (Why is no real title available?)
- scientific article; zbMATH DE number 1215494 (Why is no real title available?)
- scientific article; zbMATH DE number 1301815 (Why is no real title available?)
- scientific article; zbMATH DE number 1131675 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1157651 (Why is no real title available?)
- scientific article; zbMATH DE number 1955470 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- scientific article; zbMATH DE number 5042362 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- scientific article; zbMATH DE number 3273189 (Why is no real title available?)
- scientific article; zbMATH DE number 3339390 (Why is no real title available?)
- scientific article; zbMATH DE number 3062900 (Why is no real title available?)
- scientific article; zbMATH DE number 3090127 (Why is no real title available?)
- Loops with abelian inner mapping groups: an application of automated deduction
- Mathematical Problems
- Mathematical problems for the next century
- Mathematical proof.
- Mathematical Rigour and Informal Proof
- Mathematical significance of consistency proofs
- Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker-Congress zu Paris 1900.
- New applications of the polynomial method: the cap set conjecture and beyond
- New Sets of Independent Postulates for the Algebra of Logic, With Special Reference to Whitehead and Russell's Principia Mathematica
- On an alleged refutation of Hilbert's Program using Gödel's first incompleteness theorem
- On formal and informal provability
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On the depth of Szemerédi's theorem
- Open Problems in Mathematics
- Proving theorems by pattern recognition I
- Recursively enumerable sets of positive integers and their decision problems
- Solution of the Robbins problem
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Some thoughts on automation and mathematical research
- Systems of logic based on ordinals.
- The complexity of logical theories
- The Epistemological Status of Computer-Assisted Proofs
- The joy of SET. The many mathematical dimensions of a seemingly simple card game
- The packing chromatic number of the infinite square grid is 15
- The relationship of derivations in artificial languages to ordinary rigorous mathematical proof
- The relative efficiency of propositional proof systems
- The resolution of Keller's conjecture
- The Robbins problem: computer proofs and human proofs
- The Undecidability of the Generalized Collatz Problem
- Theorem proving in large formal mathematics as an emerging AI field
- Time Bounded Random Access Machines with Parallel Processing
- Undecidable theories
- Visual thinking in mathematics. An epistemological study
- Why Do We Prove Theorems?
- Why the Naïve Derivation Recipe Model Cannot Explain How Mathematicians’ Proofs Secure Mathematical Knowledge
- Zur Hilbertschen Beweistheorie.
- Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt.
This page was built for publication: Artificial intelligence and inherent mathematical difficulty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6867107)
