Table of Contents
- 1 Which of the problems are unsolved in computer science?
- 2 What are unanswered questions in computer science?
- 3 Are there problems that computers can’t solve?
- 4 What is the most open problem in theoretical computer science?
- 5 What are some unsolved mathematical problems?
- 6 What are some unsolved problems in physics?
Which of the problems are unsolved in computer science?
Can leaf powers and k-leaf powers be recognized in polynomial time? Can parity games be solved in polynomial time? Can the rotation distance between two binary trees be computed in polynomial time? Can graphs of bounded clique-width be recognized in polynomial time?
What are unanswered questions in computer science?
Theoretical Computer Science
| Title | Author(s) | Topic » Subtopic |
|---|---|---|
| The robustness of the tensor product | Ben-Sasson; Sudan | Coding Theory |
| Subset-sums equality (pigeonhole version) | Complexity | |
| Complexity of square-root sum | Goemans | Complexity |
| Linear-size circuits for stable $0,1 < 2$ sorting? | Regan | Complexity |
What are the current issues in computer science?
5 Trends in Computer Science Research
- Artificial intelligence and robotics.
- Big data analytics.
- Computer-assisted education.
- Bioinformatics.
- Cyber security.
What are some unsolved problems?
Unsolved Problems
- The Goldbach conjecture.
- The Riemann hypothesis.
- The conjecture that there exists a Hadamard matrix for every positive multiple of 4.
- The twin prime conjecture (i.e., the conjecture that there are an infinite number of twin primes).
- Determination of whether NP-problems are actually P-problems.
Are there problems that computers can’t solve?
In 1936, the brilliant mathematician and codebreaker Alan Turing proved that it’s impossible for a computer to inspect any code that you give it, and correctly tell you whether the code will halt or run forever. In other words, Turing showed that a computer can never solve the Halting Problem.
What is the most open problem in theoretical computer science?
Frequently called the most important outstanding question in theoretical computer science, the equivalency of P and NP is one of the seven problems that the Clay Mathematics Institute will give you a million dollars for proving — or disproving.
How do computer scientists solve problems?
Given a problem, a computer scientist’s goal is to develop an algorithm, a step-by-step list of instructions for solving any instance of the problem that might arise. Algorithms are finite processes that if followed will solve the problem. Algorithms are solutions.
What is trending computer science?
The latest computer science trends include artificial intelligence, edge computing, and quantum computing. IT professionals are also knowledgeable about developments in robotics and cybersecurity.
What are some unsolved mathematical problems?
Unsolved Problems. There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include. 1. The Goldbach conjecture. 2. The Riemann hypothesis.
What are some unsolved problems in physics?
Some of the major unsolved problems in physics are theoretical, meaning that existing theories seem incapable of explaining a certain observed phenomenon or experimental result. The others are experimental, meaning that there is a difficulty in creating an experiment to test a proposed theory or investigate a phenomenon in greater detail.
Is computer science a real science?
The most difficult objection has been that computing can’t be a science because science deals with natural phenomena, whereas computers are manmade. They say that, at best, computing is a science of the artificial, not a real science.