Live briefing
Everything about AI-complete
Term describing difficult problems in AI
In the field of artificial intelligence (AI), tasks that are hypothesized to require artificial general intelligence to solve are informally known as AI-complete or AI-hard. Calling a problem AI-complete reflects the belief that it cannot be solved by a simple specific algorithm. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: AI-completeA 5-minute orientation
- Skim a recent paper: The complete sequence of a human genomeInfluential work since 2022
- Pick up a classic book: Alice's Adventures in WonderlandThe most-reprinted book on the subject
- Read the landmark paper: OLEX2 : a complete structure solution, refinement and analysis programCited 32,795 times
- Go sideways: Evolutionary computationA closely related topic
- Go sideways: AI capability controlA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
OLEX2 : a complete structure solution, refinement and analysis program
An analysis of variance test for normality (complete samples)
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Predicting transmembrane protein topology with a hidden markov model: application to complete genomes11Edited by F. Cohen
genepop ’007: a complete re‐implementation of the genepop software for Windows and Linux
Deciphering the biology of Mycobacterium tuberculosis from the complete genome sequence
The Complete Genome Sequence of Escherichia coli K-12
SREBPs: activators of the complete program of cholesterol and fatty acid synthesis in the liver
🆕 Influential since 2022
📚 Books worth reading
Alice's Adventures in WonderlandLewis Carroll · 1865
Jane EyreCharlotte Brontë · 1847
SonnetsWilliam Shakespeare · 1609
Think and Grow RichNapoleon Hill · 1937
Seven Pillars of WisdomT. E. Lawrence · 1905
Breast cancerYashar Hirshaut, Peter Pressman · 1992- 📕Cybersecurity Body of KnowledgeDaniel Shoemaker, Anne Kohnke · 2020
ASPCA complete cat care manualA. T. B. Edney · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Evolutionary computation Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield…
- AI capability control AI capability control, also known as AI confinement refers to computer security procedures aimed to monitor and control the behavior of AI systems in order…
- Polynomial-time reduction In computational complexity theory, a polynomial-time reduction is a method for solving one problem using another. One shows that if a hypothetical subroutine…
- Computational intelligence In computer science, computational intelligence (CI) refers to concepts, paradigms, algorithms and implementations of systems that are designed to show…
- PSPACE-complete In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input…
- 2-EXPTIME In computational complexity theory, the complexity class 2-EXPTIME (sometimes called 2-EXP, sometimes also written 2EXPTIME) is the set of all decision…
- Exponential time hypothesis In computational complexity theory, the exponential time hypothesis (ETH) states that satisfiability of 3-CNF Boolean formulas (3-SAT) cannot be solved…
- P (complexity) In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can…