Unsolved Problems due to Lack of Computational PowerExamples of falsified (or currently open) longstanding conjectures leading to large bodies of incorrect results.Computational Maths - Normalised mantissaDatabase of unsolved problems in mathematicsHow to know if one problem is more difficult than another one?Soft question: Reference on sociology of mathematics
Is there a fallacy about "appeal to 'big words'"?
Typesetting "hollow slash"
What is the question mark?
Is Fourier series a sampled version of Fourier transform?
Expressing a chain of boolean ORs using ILP
Is this really better analyzed in G minor than in Bb?
May the tower use the runway while an emergency aircraft is inbound?
Output with the same length always
How do I ask for 2-3 days per week remote work in a job interview?
What exactly happened to the 18 crew members who were reported as "missing" in "Q Who"?
Is there a word for returning to unpreparedness?
How does Monero protect users from inflation bugs if the blockchain can't be audited?
What are the advantages of this gold finger shape?
String routines
Eric Andre had a dream
Are there any rules on how characters go from 0th to 1st level in a class?
I was dismissed as a candidate for an abroad company after disclosing my disability
Why does "auf der Strecke bleiben" mean "to fall by the wayside"?
Is a USB 3.0 device possible with a four contact USB 2.0 connector?
What should we do with manuals from the 80s?
If a person claims to know anything could it be disproven by saying 'prove that we are not in a simulation'?
What should I do with the stock I own if I anticipate there will be a recession?
Why is su world executable?
What's the relationship betweeen MS-DOS and XENIX?
Unsolved Problems due to Lack of Computational Power
Examples of falsified (or currently open) longstanding conjectures leading to large bodies of incorrect results.Computational Maths - Normalised mantissaDatabase of unsolved problems in mathematicsHow to know if one problem is more difficult than another one?Soft question: Reference on sociology of mathematics
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
I was recently reading up about computational power and its uses in maths particularly to find counterexamples to conjectures. I was wondering are there any current mathematical problems which we are unable to solve due to our lack of computational power or inaccessibility to it.
What exactly am I looking for?
Problems of which we know that they can be solved with a finite (but very long) computation?
(e. g. NOT the Riemann hypothesis or twin prime conjecture)
I am looking for specific examples.
soft-question computer-science computational-mathematics computer-assisted-proofs
asked 8 hours ago
StackUpPhysicsStackUpPhysics
4251 silver badge9 bronze badges
$endgroup$
add a comment |
$begingroup$
I was recently reading up about computational power and its uses in maths particularly to find counterexamples to conjectures. I was wondering are there any current mathematical problems which we are unable to solve due to our lack of computational power or inaccessibility to it.
What exactly am I looking for?
Problems of which we know that they can be solved with a finite (but very long) computation?
(e. g. NOT the Riemann hypothesis or twin prime conjecture)
I am looking for specific examples.
soft-question computer-science computational-mathematics computer-assisted-proofs
asked 8 hours ago
StackUpPhysicsStackUpPhysics
4251 silver badge9 bronze badges
$endgroup$
1
$begingroup$
What exactly are you looking for? Problems of which we know that they can be solved with a finite (but very long) computation? (e. g. not the Riemann hypothesis or twin prime conjecture)
$endgroup$
– 0x539
8 hours ago
$begingroup$
@stackupphysics I think you need to clarify whether "lack" refers to a technological insufficiency (e.g. we don't yet have enough processing power) or a theoretical insufficiency (e.g. even a perfect computer could never solve the problem).
$endgroup$
– Jam
8 hours ago
$begingroup$
@0x539 I'll update
$endgroup$
– StackUpPhysics
1 hour ago
add a comment |
$begingroup$
I was recently reading up about computational power and its uses in maths particularly to find counterexamples to conjectures. I was wondering are there any current mathematical problems which we are unable to solve due to our lack of computational power or inaccessibility to it.
What exactly am I looking for?
Problems of which we know that they can be solved with a finite (but very long) computation?
(e. g. NOT the Riemann hypothesis or twin prime conjecture)
I am looking for specific examples.
soft-question computer-science computational-mathematics computer-assisted-proofs
asked 8 hours ago
StackUpPhysicsStackUpPhysics
4251 silver badge9 bronze badges
$endgroup$
I was recently reading up about computational power and its uses in maths particularly to find counterexamples to conjectures. I was wondering are there any current mathematical problems which we are unable to solve due to our lack of computational power or inaccessibility to it.
What exactly am I looking for?
Problems of which we know that they can be solved with a finite (but very long) computation?
(e. g. NOT the Riemann hypothesis or twin prime conjecture)
I am looking for specific examples.
soft-question computer-science computational-mathematics computer-assisted-proofs
soft-question computer-science computational-mathematics computer-assisted-proofs
asked 8 hours ago
StackUpPhysicsStackUpPhysics
4251 silver badge9 bronze badges
asked 8 hours ago
StackUpPhysicsStackUpPhysics
4251 silver badge9 bronze badges
edited 23 mins ago
StackUpPhysics
asked 8 hours ago
StackUpPhysicsStackUpPhysics
4251 silver badge9 bronze badges
asked 8 hours ago
StackUpPhysicsStackUpPhysics
4251 silver badge9 bronze badges
asked 8 hours ago
StackUpPhysicsStackUpPhysics
4251 silver badge9 bronze badges
4251 silver badge9 bronze badges
1
$begingroup$
What exactly are you looking for? Problems of which we know that they can be solved with a finite (but very long) computation? (e. g. not the Riemann hypothesis or twin prime conjecture)
$endgroup$
– 0x539
8 hours ago
$begingroup$
@stackupphysics I think you need to clarify whether "lack" refers to a technological insufficiency (e.g. we don't yet have enough processing power) or a theoretical insufficiency (e.g. even a perfect computer could never solve the problem).
$endgroup$
– Jam
8 hours ago
$begingroup$
@0x539 I'll update
$endgroup$
– StackUpPhysics
1 hour ago
add a comment |
1
$begingroup$
What exactly are you looking for? Problems of which we know that they can be solved with a finite (but very long) computation? (e. g. not the Riemann hypothesis or twin prime conjecture)
$endgroup$
– 0x539
8 hours ago
$begingroup$
@stackupphysics I think you need to clarify whether "lack" refers to a technological insufficiency (e.g. we don't yet have enough processing power) or a theoretical insufficiency (e.g. even a perfect computer could never solve the problem).
$endgroup$
– Jam
8 hours ago
$begingroup$
@0x539 I'll update
$endgroup$
– StackUpPhysics
1 hour ago
1
1
$begingroup$
What exactly are you looking for? Problems of which we know that they can be solved with a finite (but very long) computation? (e. g. not the Riemann hypothesis or twin prime conjecture)
$endgroup$
– 0x539
8 hours ago
$begingroup$
What exactly are you looking for? Problems of which we know that they can be solved with a finite (but very long) computation? (e. g. not the Riemann hypothesis or twin prime conjecture)
$endgroup$
– 0x539
8 hours ago
$begingroup$
@stackupphysics I think you need to clarify whether "lack" refers to a technological insufficiency (e.g. we don't yet have enough processing power) or a theoretical insufficiency (e.g. even a perfect computer could never solve the problem).
$endgroup$
– Jam
8 hours ago
$begingroup$
@stackupphysics I think you need to clarify whether "lack" refers to a technological insufficiency (e.g. we don't yet have enough processing power) or a theoretical insufficiency (e.g. even a perfect computer could never solve the problem).
$endgroup$
– Jam
8 hours ago
$begingroup$
@0x539 I'll update
$endgroup$
– StackUpPhysics
1 hour ago
$begingroup$
@0x539 I'll update
$endgroup$
– StackUpPhysics
1 hour ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Some notorious problems of this kind are in discrete mathematics but involve a search space that is many magnitudes beyond what is feasible. For example the values of certain Ramsey numbers
http://mathworld.wolfram.com/RamseyNumber.html
or the existence of a Moore graph of degree 57 https://en.wikipedia.org/wiki/Moore_graph
answered 8 hours ago
ahulpkeahulpke
7,80711 silver badges26 bronze badges
$endgroup$
add a comment |
$begingroup$
Goldbach's weak conjecture isn't a conjecture anymore, but before it was proved (in 2013), it had already been proved that it was true for every $n>e^e^16,038$. It was not computationally possible to test it for all numbers $nleqslant e^e^16,038$ though.
answered 8 hours ago
José Carlos SantosJosé Carlos Santos
208k26 gold badges163 silver badges287 bronze badges
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3325462%2funsolved-problems-due-to-lack-of-computational-power%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Some notorious problems of this kind are in discrete mathematics but involve a search space that is many magnitudes beyond what is feasible. For example the values of certain Ramsey numbers
http://mathworld.wolfram.com/RamseyNumber.html
or the existence of a Moore graph of degree 57 https://en.wikipedia.org/wiki/Moore_graph
answered 8 hours ago
ahulpkeahulpke
7,80711 silver badges26 bronze badges
$endgroup$
add a comment |
$begingroup$
Some notorious problems of this kind are in discrete mathematics but involve a search space that is many magnitudes beyond what is feasible. For example the values of certain Ramsey numbers
http://mathworld.wolfram.com/RamseyNumber.html
or the existence of a Moore graph of degree 57 https://en.wikipedia.org/wiki/Moore_graph
answered 8 hours ago
ahulpkeahulpke
7,80711 silver badges26 bronze badges
$endgroup$
add a comment |
$begingroup$
Some notorious problems of this kind are in discrete mathematics but involve a search space that is many magnitudes beyond what is feasible. For example the values of certain Ramsey numbers
http://mathworld.wolfram.com/RamseyNumber.html
or the existence of a Moore graph of degree 57 https://en.wikipedia.org/wiki/Moore_graph
answered 8 hours ago
ahulpkeahulpke
7,80711 silver badges26 bronze badges
$endgroup$
Some notorious problems of this kind are in discrete mathematics but involve a search space that is many magnitudes beyond what is feasible. For example the values of certain Ramsey numbers
http://mathworld.wolfram.com/RamseyNumber.html
or the existence of a Moore graph of degree 57 https://en.wikipedia.org/wiki/Moore_graph
answered 8 hours ago
ahulpkeahulpke
7,80711 silver badges26 bronze badges
answered 8 hours ago
ahulpkeahulpke
7,80711 silver badges26 bronze badges
answered 8 hours ago
ahulpkeahulpke
7,80711 silver badges26 bronze badges
answered 8 hours ago
ahulpkeahulpke
7,80711 silver badges26 bronze badges
7,80711 silver badges26 bronze badges
add a comment |
add a comment |
$begingroup$
Goldbach's weak conjecture isn't a conjecture anymore, but before it was proved (in 2013), it had already been proved that it was true for every $n>e^e^16,038$. It was not computationally possible to test it for all numbers $nleqslant e^e^16,038$ though.
answered 8 hours ago
José Carlos SantosJosé Carlos Santos
208k26 gold badges163 silver badges287 bronze badges
$endgroup$
add a comment |
$begingroup$
Goldbach's weak conjecture isn't a conjecture anymore, but before it was proved (in 2013), it had already been proved that it was true for every $n>e^e^16,038$. It was not computationally possible to test it for all numbers $nleqslant e^e^16,038$ though.
answered 8 hours ago
José Carlos SantosJosé Carlos Santos
208k26 gold badges163 silver badges287 bronze badges
$endgroup$
add a comment |
$begingroup$
Goldbach's weak conjecture isn't a conjecture anymore, but before it was proved (in 2013), it had already been proved that it was true for every $n>e^e^16,038$. It was not computationally possible to test it for all numbers $nleqslant e^e^16,038$ though.
answered 8 hours ago
José Carlos SantosJosé Carlos Santos
208k26 gold badges163 silver badges287 bronze badges
$endgroup$
Goldbach's weak conjecture isn't a conjecture anymore, but before it was proved (in 2013), it had already been proved that it was true for every $n>e^e^16,038$. It was not computationally possible to test it for all numbers $nleqslant e^e^16,038$ though.
answered 8 hours ago
José Carlos SantosJosé Carlos Santos
208k26 gold badges163 silver badges287 bronze badges
edited 7 hours ago
answered 8 hours ago
José Carlos SantosJosé Carlos Santos
208k26 gold badges163 silver badges287 bronze badges
answered 8 hours ago
José Carlos SantosJosé Carlos Santos
208k26 gold badges163 silver badges287 bronze badges
answered 8 hours ago
José Carlos SantosJosé Carlos Santos
208k26 gold badges163 silver badges287 bronze badges
208k26 gold badges163 silver badges287 bronze badges
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3325462%2funsolved-problems-due-to-lack-of-computational-power%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
What exactly are you looking for? Problems of which we know that they can be solved with a finite (but very long) computation? (e. g. not the Riemann hypothesis or twin prime conjecture)
$endgroup$
– 0x539
8 hours ago
$begingroup$
@stackupphysics I think you need to clarify whether "lack" refers to a technological insufficiency (e.g. we don't yet have enough processing power) or a theoretical insufficiency (e.g. even a perfect computer could never solve the problem).
$endgroup$
– Jam
8 hours ago
$begingroup$
@0x539 I'll update
$endgroup$
– StackUpPhysics
1 hour ago