I am unable to quantify it as there are many problems which are in polynomial time and certain problems can be reduced to polynomial time.How exactly to quantify them?
2026-03-25 07:47:17.1774424837
How many solvable and unsolvable problems exist
138 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in RECREATIONAL-MATHEMATICS
- Good ideas for communicating the joy of mathematics to nine and ten year olds
- Who has built the house of Mason?
- Is there any tri-angle ?
- In what position , the dogs will reside?
- existence of solutions of $a^n+b^n+c^n=6^n$
- Sushi Go! and optimal passing strategy
- Cut the letter $M$ to obtain $9$ single triangles by drawing $3$ straight lines
- Tennis balls problem from John H Conway's "Genius At Play"
- The Heegner Polynomials
- 2018 January Challenge: Prove inequality in geometry problem
Related Questions in PHILOSOPHY
- Does Planck length contradict math?
- Should axioms be seen as "building blocks of definitions"?
- Difference between provability and truth of Goodstein's theorem
- Decidability and "truth value"
- Is it possible to construct a formal system such that all interesting statements from ZFC can be proven within the system?
- Why linear congruential generator is called random number generator?
- Why is negative minus negative not negative? Why is negative times positive not directionless?
- What's the difference between a proof and a derivation?
- Godel's Theorems and Conventionalism
- Is "This sentence is true" true or false (or both); is it a proposition?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Are you talking about solvable versus unsolvable, or polynomial time versus not polynomial time?
Assuming we're restricted to problems that can be described by a finite expression in a given language having a finite alphabet, the number of problems is countably infinite.
There are countably many solvable problems (since if $A$ is one solvable problem, and $B$ is any problem, you can get a solvable problem of the form "do $A$ or $B$"), and countably many unsolvable problems (since if $C$ is one unsolvable problem, and $B$ is any problem, you can get an unsolvable problem of the form "do $B$ and $C$").