Examples of “unsuccessful” theories with afterlivesWhy did Voiculescu develop free probability?Fundamental ExamplesFields of mathematics that were dormant for a long time until someone revitalized themWhat elementary problems can you solve with schemes?What classification theorems have been improved by re-categorizing?Hodge Theory (Voisin)Examples of unexpected mathematical imagesIntuition behind the definition of quantum groupsCategory theory & geometric measure theory?

Examples of “unsuccessful” theories with afterlives


Why did Voiculescu develop free probability?Fundamental ExamplesFields of mathematics that were dormant for a long time until someone revitalized themWhat elementary problems can you solve with schemes?What classification theorems have been improved by re-categorizing?Hodge Theory (Voisin)Examples of unexpected mathematical imagesIntuition behind the definition of quantum groupsCategory theory & geometric measure theory?













5












$begingroup$


I am looking for examples of mathematical theories which were introduced with a certain goal in mind, and which failed to achieved this goal, but which nevertheless developed on their own and continued to be studied for other reasons.



Here are two prominent examples I know of:




  • The representation theory of finite groups: I believe the representation theory of finite groups (which at that time might have been called "character theory") was introduced by Frobenius with the purpose of understanding the structure of finite group in general. While there are certainly important structural results about finite groups that were first proved using representation theory (e.g., Burnside's theorem), the tremendous advances in our understanding of finite groups in the mid-to-late 20th century (e.g., the classification of finite simple groups) did not heavily use representation theory. Nevertheless, the representation theory of the symmetric group, of finite groups of Lie type, positive characteristic phenomenon, etc. continue to be important topics of research.


  • Lie theory: It is my understanding that Lie introduced Lie groups with the idea that they would help in solving differential equations (I guess, by consideration of the symmetries of these equations). While symmetry techniques for differential equations to some extent continue to be studied (see differential Galois theory), they remain far from the mainstream of DE research. But of course Lie theory is nonetheless now seen as a central topic in mathematics.

Are there some other examples along these lines?










share|cite|improve this question











$endgroup$









  • 3




    $begingroup$
    Does the proof of Feit-Thompson really eschew representation theory? I don't know much about the area, but the linked wiki page gives quite the opposite impression.
    $endgroup$
    – lambda
    8 hours ago











  • $begingroup$
    @lambda: maybe you are right
    $endgroup$
    – Sam Hopkins
    8 hours ago






  • 5




    $begingroup$
    Non-Euclidean geometry was initially developed in hopes of deriving the parallel postulate from the other axioms of Euclidean geometry. Nowadays it describes two of the basic model geometries in Riemannian geometry - the sphere and hyperbolic space.
    $endgroup$
    – Terry Tao
    8 hours ago






  • 5




    $begingroup$
    Many parts of graph theory originated or were stimulated in attempts to tackle the 4-colour conjecture. Perhaps the chromatic polynomial is the principal example of something explicitly introduced for the 4CC, which played no role in its solution, but which then went on to be significant in the study of phase transitions in the Potts model.
    $endgroup$
    – Gordon Royle
    7 hours ago















5












$begingroup$


I am looking for examples of mathematical theories which were introduced with a certain goal in mind, and which failed to achieved this goal, but which nevertheless developed on their own and continued to be studied for other reasons.



Here are two prominent examples I know of:




  • The representation theory of finite groups: I believe the representation theory of finite groups (which at that time might have been called "character theory") was introduced by Frobenius with the purpose of understanding the structure of finite group in general. While there are certainly important structural results about finite groups that were first proved using representation theory (e.g., Burnside's theorem), the tremendous advances in our understanding of finite groups in the mid-to-late 20th century (e.g., the classification of finite simple groups) did not heavily use representation theory. Nevertheless, the representation theory of the symmetric group, of finite groups of Lie type, positive characteristic phenomenon, etc. continue to be important topics of research.


  • Lie theory: It is my understanding that Lie introduced Lie groups with the idea that they would help in solving differential equations (I guess, by consideration of the symmetries of these equations). While symmetry techniques for differential equations to some extent continue to be studied (see differential Galois theory), they remain far from the mainstream of DE research. But of course Lie theory is nonetheless now seen as a central topic in mathematics.

Are there some other examples along these lines?










share|cite|improve this question











$endgroup$









  • 3




    $begingroup$
    Does the proof of Feit-Thompson really eschew representation theory? I don't know much about the area, but the linked wiki page gives quite the opposite impression.
    $endgroup$
    – lambda
    8 hours ago











  • $begingroup$
    @lambda: maybe you are right
    $endgroup$
    – Sam Hopkins
    8 hours ago






  • 5




    $begingroup$
    Non-Euclidean geometry was initially developed in hopes of deriving the parallel postulate from the other axioms of Euclidean geometry. Nowadays it describes two of the basic model geometries in Riemannian geometry - the sphere and hyperbolic space.
    $endgroup$
    – Terry Tao
    8 hours ago






  • 5




    $begingroup$
    Many parts of graph theory originated or were stimulated in attempts to tackle the 4-colour conjecture. Perhaps the chromatic polynomial is the principal example of something explicitly introduced for the 4CC, which played no role in its solution, but which then went on to be significant in the study of phase transitions in the Potts model.
    $endgroup$
    – Gordon Royle
    7 hours ago













5












5








5





$begingroup$


I am looking for examples of mathematical theories which were introduced with a certain goal in mind, and which failed to achieved this goal, but which nevertheless developed on their own and continued to be studied for other reasons.



Here are two prominent examples I know of:




  • The representation theory of finite groups: I believe the representation theory of finite groups (which at that time might have been called "character theory") was introduced by Frobenius with the purpose of understanding the structure of finite group in general. While there are certainly important structural results about finite groups that were first proved using representation theory (e.g., Burnside's theorem), the tremendous advances in our understanding of finite groups in the mid-to-late 20th century (e.g., the classification of finite simple groups) did not heavily use representation theory. Nevertheless, the representation theory of the symmetric group, of finite groups of Lie type, positive characteristic phenomenon, etc. continue to be important topics of research.


  • Lie theory: It is my understanding that Lie introduced Lie groups with the idea that they would help in solving differential equations (I guess, by consideration of the symmetries of these equations). While symmetry techniques for differential equations to some extent continue to be studied (see differential Galois theory), they remain far from the mainstream of DE research. But of course Lie theory is nonetheless now seen as a central topic in mathematics.

Are there some other examples along these lines?










share|cite|improve this question











$endgroup$




I am looking for examples of mathematical theories which were introduced with a certain goal in mind, and which failed to achieved this goal, but which nevertheless developed on their own and continued to be studied for other reasons.



Here are two prominent examples I know of:




  • The representation theory of finite groups: I believe the representation theory of finite groups (which at that time might have been called "character theory") was introduced by Frobenius with the purpose of understanding the structure of finite group in general. While there are certainly important structural results about finite groups that were first proved using representation theory (e.g., Burnside's theorem), the tremendous advances in our understanding of finite groups in the mid-to-late 20th century (e.g., the classification of finite simple groups) did not heavily use representation theory. Nevertheless, the representation theory of the symmetric group, of finite groups of Lie type, positive characteristic phenomenon, etc. continue to be important topics of research.


  • Lie theory: It is my understanding that Lie introduced Lie groups with the idea that they would help in solving differential equations (I guess, by consideration of the symmetries of these equations). While symmetry techniques for differential equations to some extent continue to be studied (see differential Galois theory), they remain far from the mainstream of DE research. But of course Lie theory is nonetheless now seen as a central topic in mathematics.

Are there some other examples along these lines?







soft-question ho.history-overview big-list






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 6 hours ago









Bullet51

2,9521 gold badge8 silver badges25 bronze badges




2,9521 gold badge8 silver badges25 bronze badges










asked 8 hours ago









Sam HopkinsSam Hopkins

6,5571 gold badge31 silver badges67 bronze badges




6,5571 gold badge31 silver badges67 bronze badges










  • 3




    $begingroup$
    Does the proof of Feit-Thompson really eschew representation theory? I don't know much about the area, but the linked wiki page gives quite the opposite impression.
    $endgroup$
    – lambda
    8 hours ago











  • $begingroup$
    @lambda: maybe you are right
    $endgroup$
    – Sam Hopkins
    8 hours ago






  • 5




    $begingroup$
    Non-Euclidean geometry was initially developed in hopes of deriving the parallel postulate from the other axioms of Euclidean geometry. Nowadays it describes two of the basic model geometries in Riemannian geometry - the sphere and hyperbolic space.
    $endgroup$
    – Terry Tao
    8 hours ago






  • 5




    $begingroup$
    Many parts of graph theory originated or were stimulated in attempts to tackle the 4-colour conjecture. Perhaps the chromatic polynomial is the principal example of something explicitly introduced for the 4CC, which played no role in its solution, but which then went on to be significant in the study of phase transitions in the Potts model.
    $endgroup$
    – Gordon Royle
    7 hours ago












  • 3




    $begingroup$
    Does the proof of Feit-Thompson really eschew representation theory? I don't know much about the area, but the linked wiki page gives quite the opposite impression.
    $endgroup$
    – lambda
    8 hours ago











  • $begingroup$
    @lambda: maybe you are right
    $endgroup$
    – Sam Hopkins
    8 hours ago






  • 5




    $begingroup$
    Non-Euclidean geometry was initially developed in hopes of deriving the parallel postulate from the other axioms of Euclidean geometry. Nowadays it describes two of the basic model geometries in Riemannian geometry - the sphere and hyperbolic space.
    $endgroup$
    – Terry Tao
    8 hours ago






  • 5




    $begingroup$
    Many parts of graph theory originated or were stimulated in attempts to tackle the 4-colour conjecture. Perhaps the chromatic polynomial is the principal example of something explicitly introduced for the 4CC, which played no role in its solution, but which then went on to be significant in the study of phase transitions in the Potts model.
    $endgroup$
    – Gordon Royle
    7 hours ago







3




3




$begingroup$
Does the proof of Feit-Thompson really eschew representation theory? I don't know much about the area, but the linked wiki page gives quite the opposite impression.
$endgroup$
– lambda
8 hours ago





$begingroup$
Does the proof of Feit-Thompson really eschew representation theory? I don't know much about the area, but the linked wiki page gives quite the opposite impression.
$endgroup$
– lambda
8 hours ago













$begingroup$
@lambda: maybe you are right
$endgroup$
– Sam Hopkins
8 hours ago




$begingroup$
@lambda: maybe you are right
$endgroup$
– Sam Hopkins
8 hours ago




5




5




$begingroup$
Non-Euclidean geometry was initially developed in hopes of deriving the parallel postulate from the other axioms of Euclidean geometry. Nowadays it describes two of the basic model geometries in Riemannian geometry - the sphere and hyperbolic space.
$endgroup$
– Terry Tao
8 hours ago




$begingroup$
Non-Euclidean geometry was initially developed in hopes of deriving the parallel postulate from the other axioms of Euclidean geometry. Nowadays it describes two of the basic model geometries in Riemannian geometry - the sphere and hyperbolic space.
$endgroup$
– Terry Tao
8 hours ago




5




5




$begingroup$
Many parts of graph theory originated or were stimulated in attempts to tackle the 4-colour conjecture. Perhaps the chromatic polynomial is the principal example of something explicitly introduced for the 4CC, which played no role in its solution, but which then went on to be significant in the study of phase transitions in the Potts model.
$endgroup$
– Gordon Royle
7 hours ago




$begingroup$
Many parts of graph theory originated or were stimulated in attempts to tackle the 4-colour conjecture. Perhaps the chromatic polynomial is the principal example of something explicitly introduced for the 4CC, which played no role in its solution, but which then went on to be significant in the study of phase transitions in the Potts model.
$endgroup$
– Gordon Royle
7 hours ago










7 Answers
7






active

oldest

votes


















9














$begingroup$

I quote at length from the Wikipedia essay on the history of knot theory:



In 1867 after observing Scottish physicist Peter Tait's experiments involving smoke rings, Thomson came to the idea that atoms were knots of swirling vortices in the æther. Chemical elements would thus correspond to knots and links. Tait's experiments were inspired by a paper of Helmholtz's on vortex-rings in incompressible fluids. Thomson and Tait believed that an understanding and classification of all possible knots would explain why atoms absorb and emit light at only the discrete wavelengths that they do. For example, Thomson thought that sodium could be the Hopf link due to its two lines of spectra.



Tait subsequently began listing unique knots in the belief that he was creating a table of elements. He formulated what are now known as the Tait conjectures on alternating knots. (The conjectures were proved in the 1990s.) Tait's knot tables were subsequently improved upon by C. N. Little and Thomas Kirkman.



James Clerk Maxwell, a colleague and friend of Thomson's and Tait's, also developed a strong interest in knots. Maxwell studied Listing's work on knots. He re-interpreted Gauss' linking integral in terms of electromagnetic theory. In his formulation, the integral represented the work done by a charged particle moving along one component of the link under the influence of the magnetic field generated by an electric current along the other component. Maxwell also continued the study of smoke rings by considering three interacting rings.



When the luminiferous æther was not detected in the Michelson–Morley experiment, vortex theory became completely obsolete, and knot theory ceased to be of great scientific interest. Modern physics demonstrates that the discrete wavelengths depend on quantum energy levels.






share|cite|improve this answer









$endgroup$






















    6














    $begingroup$

    "The modern study of knots grew out an attempt by three 19th-century Scottish
    physicists to apply knot theory to fundamental questions about the universe".






    share|cite|improve this answer









    $endgroup$














    • $begingroup$
      You beat me by 16 seconds.
      $endgroup$
      – Gerry Myerson
      2 hours ago


















    2














    $begingroup$

    This is a copy of a copy of some history of the origins of free probability by Dan Voiculescu extracted from a response by Roland Speicher, a developer of the field, to an MO-Q:



    This is from his article "Background and Outlook" in the Lectures Notes
    "Free Probability and Operator Algebras", see
    http://www.ems-ph.org/books/book.php?proj_nr=208




    Just before starting in this new direction, I had worked with Mihai Pimsner,
    computing the K-theory of the reduced $C^*$-algebras of free groups. From the
    K-theory work I had acquired a taste for operator algebras associated with free
    groups and I became interested in a famous problem about the von Neumann
    algebras $L(mathbbF_n)$ generated by the left regular representations of free groups,
    which appears in Kadison's Baton-Rouge problem list. The problem, which
    may have already been known to Murray and von Neumann, is:are $L(mathbbF_m)$ and $L(mathbbF_n)$ non-isomorphic if $m not= n$?



    This is still an open problem. Fortunately, after trying in vain to solve it,
    I realized it was time to be more humble and to ask: is there anything I can
    do, which may be useful in connection with this problem? Since I had come
    across computations of norms and spectra of certain convolution operators on
    free groups (i.e., elements of $L(mathbbF_n)$), I thought of finding ways to streamline
    some of these computations and perhaps be able to compute more complicated
    examples. This, of course, meant computing expectations of powers of such
    operators with respect to the von Neumann trace-state $tau(T) = langle T e_e,e_erangle$, $e_g$
    being the canonical basis of the $l^2$-space.



    The key remark I made was that if $T_1$, $T_2$ are convolution operators on $mathbbF_m$
    and $mathbbF_n$ then the operator on $mathbbF_m+n = mathbbF_m ast mathbbF_n$ which is $T_1 + T_2$, has moments $tau((T_1 + T_2)^p)$ which depend only on the moments $tau(T_j^k)$, $j = 1, 2$ , but not
    on the actual $T_1$ and $T_2$. This was like the addition of independent random
    variables, only classical independence had to be replaced by a notion of free
    independence, which led to a free central limit theorem, a free analogue of
    the Gaussian functor, free convolution, an abstract existence theorem for one
    variable free cumulants, etc.







    share|cite|improve this answer









    $endgroup$














    • $begingroup$
      Good intro to the topic: "Three lectures on free probability" by Jonathan Novak and Michael LaCroix arxiv.org/abs/1205.2097
      $endgroup$
      – Tom Copeland
      6 hours ago


















    1














    $begingroup$

    Logic and set theory were developed by Frege, Russell and Whitehead, Hilbert and others in the late 19th, early 20th centuries with the goal of providing a firm foundation for all of Mathematics. In this they failed miserably, but nevertheless they have continued to develop and to be studied for other reasons.






    share|cite|improve this answer









    $endgroup$






















      1














      $begingroup$

      Multiplication of quaternions was introduced for use in physics for purposes for which cross-products of vectors came to be used and have been used ever since.



      But today quaternions are used in computer graphics. I suspect they also have other applications.






      share|cite|improve this answer









      $endgroup$






















        1














        $begingroup$

        Ronald Fisher's theory of fiducial inference was introduced around 1930 or so (I think?), for the purpose of solving the Behrens–Fisher problem. It turned out that fiducial intervals for that problem did not have constant coverage rates, or in what then came to be standard terminology, they are not confidence intervals. That's not necessarily fatal in some contexts, since Bayesian credible intervals don't have constant coverage rates, but everyone understands that there are good reasons for that. Fisher wrote a paper saying that that criticism is unconvincing, and I wonder if anyone understands what Fisher was trying to say. Fisher was brilliant but irascible. (He was a very prolific author of research papers in statistical theory and in population genetics, a science of which he was one of the three major founders. I think he may have single-handedly founded the theory of design of experiments, but I'm not sure about that.)



        However, fiducial methods seem to be undergoing some sort of revival:



        https://statistics.fas.harvard.edu/event/4th-bayesian-fiducial-and-frequentist-conference-bff4






        share|cite|improve this answer









        $endgroup$






















          0














          $begingroup$

          The typical oracle methods of Computability theory AKA Recursion theory were shown to be insufficient to settle the P vs. NP problem by Baker, Gill and Solovay 1975.



          Thus recursion theory became divorced from the problems of efficient computability and experienced a bit of a setback (not as many papers in Ann.Math. anymore etc.).



          Nevertheless it continued as the study of in principle computability.






          share|cite|improve this answer









          $endgroup$










          • 3




            $begingroup$
            Oracle methods predate the interest in or even formulation of P=NP. The failure of oracle methods for that problem surely highlighted the distance between computabilirt and efficient computation, but I don’t think the two subjects were ever very married.
            $endgroup$
            – Matt F.
            7 hours ago










          • $begingroup$
            @MattF. Fair enough but people became more interested in efficient computability than in-principle computability, because of practical applications.
            $endgroup$
            – Bjørn Kjos-Hanssen
            just now













          Your Answer








          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "504"
          ;
          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/4.0/"u003ecc by-sa 4.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
          );



          );














          draft saved

          draft discarded
















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f341959%2fexamples-of-unsuccessful-theories-with-afterlives%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          7 Answers
          7






          active

          oldest

          votes








          7 Answers
          7






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          9














          $begingroup$

          I quote at length from the Wikipedia essay on the history of knot theory:



          In 1867 after observing Scottish physicist Peter Tait's experiments involving smoke rings, Thomson came to the idea that atoms were knots of swirling vortices in the æther. Chemical elements would thus correspond to knots and links. Tait's experiments were inspired by a paper of Helmholtz's on vortex-rings in incompressible fluids. Thomson and Tait believed that an understanding and classification of all possible knots would explain why atoms absorb and emit light at only the discrete wavelengths that they do. For example, Thomson thought that sodium could be the Hopf link due to its two lines of spectra.



          Tait subsequently began listing unique knots in the belief that he was creating a table of elements. He formulated what are now known as the Tait conjectures on alternating knots. (The conjectures were proved in the 1990s.) Tait's knot tables were subsequently improved upon by C. N. Little and Thomas Kirkman.



          James Clerk Maxwell, a colleague and friend of Thomson's and Tait's, also developed a strong interest in knots. Maxwell studied Listing's work on knots. He re-interpreted Gauss' linking integral in terms of electromagnetic theory. In his formulation, the integral represented the work done by a charged particle moving along one component of the link under the influence of the magnetic field generated by an electric current along the other component. Maxwell also continued the study of smoke rings by considering three interacting rings.



          When the luminiferous æther was not detected in the Michelson–Morley experiment, vortex theory became completely obsolete, and knot theory ceased to be of great scientific interest. Modern physics demonstrates that the discrete wavelengths depend on quantum energy levels.






          share|cite|improve this answer









          $endgroup$



















            9














            $begingroup$

            I quote at length from the Wikipedia essay on the history of knot theory:



            In 1867 after observing Scottish physicist Peter Tait's experiments involving smoke rings, Thomson came to the idea that atoms were knots of swirling vortices in the æther. Chemical elements would thus correspond to knots and links. Tait's experiments were inspired by a paper of Helmholtz's on vortex-rings in incompressible fluids. Thomson and Tait believed that an understanding and classification of all possible knots would explain why atoms absorb and emit light at only the discrete wavelengths that they do. For example, Thomson thought that sodium could be the Hopf link due to its two lines of spectra.



            Tait subsequently began listing unique knots in the belief that he was creating a table of elements. He formulated what are now known as the Tait conjectures on alternating knots. (The conjectures were proved in the 1990s.) Tait's knot tables were subsequently improved upon by C. N. Little and Thomas Kirkman.



            James Clerk Maxwell, a colleague and friend of Thomson's and Tait's, also developed a strong interest in knots. Maxwell studied Listing's work on knots. He re-interpreted Gauss' linking integral in terms of electromagnetic theory. In his formulation, the integral represented the work done by a charged particle moving along one component of the link under the influence of the magnetic field generated by an electric current along the other component. Maxwell also continued the study of smoke rings by considering three interacting rings.



            When the luminiferous æther was not detected in the Michelson–Morley experiment, vortex theory became completely obsolete, and knot theory ceased to be of great scientific interest. Modern physics demonstrates that the discrete wavelengths depend on quantum energy levels.






            share|cite|improve this answer









            $endgroup$

















              9














              9










              9







              $begingroup$

              I quote at length from the Wikipedia essay on the history of knot theory:



              In 1867 after observing Scottish physicist Peter Tait's experiments involving smoke rings, Thomson came to the idea that atoms were knots of swirling vortices in the æther. Chemical elements would thus correspond to knots and links. Tait's experiments were inspired by a paper of Helmholtz's on vortex-rings in incompressible fluids. Thomson and Tait believed that an understanding and classification of all possible knots would explain why atoms absorb and emit light at only the discrete wavelengths that they do. For example, Thomson thought that sodium could be the Hopf link due to its two lines of spectra.



              Tait subsequently began listing unique knots in the belief that he was creating a table of elements. He formulated what are now known as the Tait conjectures on alternating knots. (The conjectures were proved in the 1990s.) Tait's knot tables were subsequently improved upon by C. N. Little and Thomas Kirkman.



              James Clerk Maxwell, a colleague and friend of Thomson's and Tait's, also developed a strong interest in knots. Maxwell studied Listing's work on knots. He re-interpreted Gauss' linking integral in terms of electromagnetic theory. In his formulation, the integral represented the work done by a charged particle moving along one component of the link under the influence of the magnetic field generated by an electric current along the other component. Maxwell also continued the study of smoke rings by considering three interacting rings.



              When the luminiferous æther was not detected in the Michelson–Morley experiment, vortex theory became completely obsolete, and knot theory ceased to be of great scientific interest. Modern physics demonstrates that the discrete wavelengths depend on quantum energy levels.






              share|cite|improve this answer









              $endgroup$



              I quote at length from the Wikipedia essay on the history of knot theory:



              In 1867 after observing Scottish physicist Peter Tait's experiments involving smoke rings, Thomson came to the idea that atoms were knots of swirling vortices in the æther. Chemical elements would thus correspond to knots and links. Tait's experiments were inspired by a paper of Helmholtz's on vortex-rings in incompressible fluids. Thomson and Tait believed that an understanding and classification of all possible knots would explain why atoms absorb and emit light at only the discrete wavelengths that they do. For example, Thomson thought that sodium could be the Hopf link due to its two lines of spectra.



              Tait subsequently began listing unique knots in the belief that he was creating a table of elements. He formulated what are now known as the Tait conjectures on alternating knots. (The conjectures were proved in the 1990s.) Tait's knot tables were subsequently improved upon by C. N. Little and Thomas Kirkman.



              James Clerk Maxwell, a colleague and friend of Thomson's and Tait's, also developed a strong interest in knots. Maxwell studied Listing's work on knots. He re-interpreted Gauss' linking integral in terms of electromagnetic theory. In his formulation, the integral represented the work done by a charged particle moving along one component of the link under the influence of the magnetic field generated by an electric current along the other component. Maxwell also continued the study of smoke rings by considering three interacting rings.



              When the luminiferous æther was not detected in the Michelson–Morley experiment, vortex theory became completely obsolete, and knot theory ceased to be of great scientific interest. Modern physics demonstrates that the discrete wavelengths depend on quantum energy levels.







              share|cite|improve this answer












              share|cite|improve this answer



              share|cite|improve this answer










              answered 8 hours ago









              Gerry MyersonGerry Myerson

              31.8k6 gold badges146 silver badges190 bronze badges




              31.8k6 gold badges146 silver badges190 bronze badges
























                  6














                  $begingroup$

                  "The modern study of knots grew out an attempt by three 19th-century Scottish
                  physicists to apply knot theory to fundamental questions about the universe".






                  share|cite|improve this answer









                  $endgroup$














                  • $begingroup$
                    You beat me by 16 seconds.
                    $endgroup$
                    – Gerry Myerson
                    2 hours ago















                  6














                  $begingroup$

                  "The modern study of knots grew out an attempt by three 19th-century Scottish
                  physicists to apply knot theory to fundamental questions about the universe".






                  share|cite|improve this answer









                  $endgroup$














                  • $begingroup$
                    You beat me by 16 seconds.
                    $endgroup$
                    – Gerry Myerson
                    2 hours ago













                  6














                  6










                  6







                  $begingroup$

                  "The modern study of knots grew out an attempt by three 19th-century Scottish
                  physicists to apply knot theory to fundamental questions about the universe".






                  share|cite|improve this answer









                  $endgroup$



                  "The modern study of knots grew out an attempt by three 19th-century Scottish
                  physicists to apply knot theory to fundamental questions about the universe".







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 8 hours ago









                  Nik WeaverNik Weaver

                  24.4k1 gold badge53 silver badges141 bronze badges




                  24.4k1 gold badge53 silver badges141 bronze badges














                  • $begingroup$
                    You beat me by 16 seconds.
                    $endgroup$
                    – Gerry Myerson
                    2 hours ago
















                  • $begingroup$
                    You beat me by 16 seconds.
                    $endgroup$
                    – Gerry Myerson
                    2 hours ago















                  $begingroup$
                  You beat me by 16 seconds.
                  $endgroup$
                  – Gerry Myerson
                  2 hours ago




                  $begingroup$
                  You beat me by 16 seconds.
                  $endgroup$
                  – Gerry Myerson
                  2 hours ago











                  2














                  $begingroup$

                  This is a copy of a copy of some history of the origins of free probability by Dan Voiculescu extracted from a response by Roland Speicher, a developer of the field, to an MO-Q:



                  This is from his article "Background and Outlook" in the Lectures Notes
                  "Free Probability and Operator Algebras", see
                  http://www.ems-ph.org/books/book.php?proj_nr=208




                  Just before starting in this new direction, I had worked with Mihai Pimsner,
                  computing the K-theory of the reduced $C^*$-algebras of free groups. From the
                  K-theory work I had acquired a taste for operator algebras associated with free
                  groups and I became interested in a famous problem about the von Neumann
                  algebras $L(mathbbF_n)$ generated by the left regular representations of free groups,
                  which appears in Kadison's Baton-Rouge problem list. The problem, which
                  may have already been known to Murray and von Neumann, is:are $L(mathbbF_m)$ and $L(mathbbF_n)$ non-isomorphic if $m not= n$?



                  This is still an open problem. Fortunately, after trying in vain to solve it,
                  I realized it was time to be more humble and to ask: is there anything I can
                  do, which may be useful in connection with this problem? Since I had come
                  across computations of norms and spectra of certain convolution operators on
                  free groups (i.e., elements of $L(mathbbF_n)$), I thought of finding ways to streamline
                  some of these computations and perhaps be able to compute more complicated
                  examples. This, of course, meant computing expectations of powers of such
                  operators with respect to the von Neumann trace-state $tau(T) = langle T e_e,e_erangle$, $e_g$
                  being the canonical basis of the $l^2$-space.



                  The key remark I made was that if $T_1$, $T_2$ are convolution operators on $mathbbF_m$
                  and $mathbbF_n$ then the operator on $mathbbF_m+n = mathbbF_m ast mathbbF_n$ which is $T_1 + T_2$, has moments $tau((T_1 + T_2)^p)$ which depend only on the moments $tau(T_j^k)$, $j = 1, 2$ , but not
                  on the actual $T_1$ and $T_2$. This was like the addition of independent random
                  variables, only classical independence had to be replaced by a notion of free
                  independence, which led to a free central limit theorem, a free analogue of
                  the Gaussian functor, free convolution, an abstract existence theorem for one
                  variable free cumulants, etc.







                  share|cite|improve this answer









                  $endgroup$














                  • $begingroup$
                    Good intro to the topic: "Three lectures on free probability" by Jonathan Novak and Michael LaCroix arxiv.org/abs/1205.2097
                    $endgroup$
                    – Tom Copeland
                    6 hours ago















                  2














                  $begingroup$

                  This is a copy of a copy of some history of the origins of free probability by Dan Voiculescu extracted from a response by Roland Speicher, a developer of the field, to an MO-Q:



                  This is from his article "Background and Outlook" in the Lectures Notes
                  "Free Probability and Operator Algebras", see
                  http://www.ems-ph.org/books/book.php?proj_nr=208




                  Just before starting in this new direction, I had worked with Mihai Pimsner,
                  computing the K-theory of the reduced $C^*$-algebras of free groups. From the
                  K-theory work I had acquired a taste for operator algebras associated with free
                  groups and I became interested in a famous problem about the von Neumann
                  algebras $L(mathbbF_n)$ generated by the left regular representations of free groups,
                  which appears in Kadison's Baton-Rouge problem list. The problem, which
                  may have already been known to Murray and von Neumann, is:are $L(mathbbF_m)$ and $L(mathbbF_n)$ non-isomorphic if $m not= n$?



                  This is still an open problem. Fortunately, after trying in vain to solve it,
                  I realized it was time to be more humble and to ask: is there anything I can
                  do, which may be useful in connection with this problem? Since I had come
                  across computations of norms and spectra of certain convolution operators on
                  free groups (i.e., elements of $L(mathbbF_n)$), I thought of finding ways to streamline
                  some of these computations and perhaps be able to compute more complicated
                  examples. This, of course, meant computing expectations of powers of such
                  operators with respect to the von Neumann trace-state $tau(T) = langle T e_e,e_erangle$, $e_g$
                  being the canonical basis of the $l^2$-space.



                  The key remark I made was that if $T_1$, $T_2$ are convolution operators on $mathbbF_m$
                  and $mathbbF_n$ then the operator on $mathbbF_m+n = mathbbF_m ast mathbbF_n$ which is $T_1 + T_2$, has moments $tau((T_1 + T_2)^p)$ which depend only on the moments $tau(T_j^k)$, $j = 1, 2$ , but not
                  on the actual $T_1$ and $T_2$. This was like the addition of independent random
                  variables, only classical independence had to be replaced by a notion of free
                  independence, which led to a free central limit theorem, a free analogue of
                  the Gaussian functor, free convolution, an abstract existence theorem for one
                  variable free cumulants, etc.







                  share|cite|improve this answer









                  $endgroup$














                  • $begingroup$
                    Good intro to the topic: "Three lectures on free probability" by Jonathan Novak and Michael LaCroix arxiv.org/abs/1205.2097
                    $endgroup$
                    – Tom Copeland
                    6 hours ago













                  2














                  2










                  2







                  $begingroup$

                  This is a copy of a copy of some history of the origins of free probability by Dan Voiculescu extracted from a response by Roland Speicher, a developer of the field, to an MO-Q:



                  This is from his article "Background and Outlook" in the Lectures Notes
                  "Free Probability and Operator Algebras", see
                  http://www.ems-ph.org/books/book.php?proj_nr=208




                  Just before starting in this new direction, I had worked with Mihai Pimsner,
                  computing the K-theory of the reduced $C^*$-algebras of free groups. From the
                  K-theory work I had acquired a taste for operator algebras associated with free
                  groups and I became interested in a famous problem about the von Neumann
                  algebras $L(mathbbF_n)$ generated by the left regular representations of free groups,
                  which appears in Kadison's Baton-Rouge problem list. The problem, which
                  may have already been known to Murray and von Neumann, is:are $L(mathbbF_m)$ and $L(mathbbF_n)$ non-isomorphic if $m not= n$?



                  This is still an open problem. Fortunately, after trying in vain to solve it,
                  I realized it was time to be more humble and to ask: is there anything I can
                  do, which may be useful in connection with this problem? Since I had come
                  across computations of norms and spectra of certain convolution operators on
                  free groups (i.e., elements of $L(mathbbF_n)$), I thought of finding ways to streamline
                  some of these computations and perhaps be able to compute more complicated
                  examples. This, of course, meant computing expectations of powers of such
                  operators with respect to the von Neumann trace-state $tau(T) = langle T e_e,e_erangle$, $e_g$
                  being the canonical basis of the $l^2$-space.



                  The key remark I made was that if $T_1$, $T_2$ are convolution operators on $mathbbF_m$
                  and $mathbbF_n$ then the operator on $mathbbF_m+n = mathbbF_m ast mathbbF_n$ which is $T_1 + T_2$, has moments $tau((T_1 + T_2)^p)$ which depend only on the moments $tau(T_j^k)$, $j = 1, 2$ , but not
                  on the actual $T_1$ and $T_2$. This was like the addition of independent random
                  variables, only classical independence had to be replaced by a notion of free
                  independence, which led to a free central limit theorem, a free analogue of
                  the Gaussian functor, free convolution, an abstract existence theorem for one
                  variable free cumulants, etc.







                  share|cite|improve this answer









                  $endgroup$



                  This is a copy of a copy of some history of the origins of free probability by Dan Voiculescu extracted from a response by Roland Speicher, a developer of the field, to an MO-Q:



                  This is from his article "Background and Outlook" in the Lectures Notes
                  "Free Probability and Operator Algebras", see
                  http://www.ems-ph.org/books/book.php?proj_nr=208




                  Just before starting in this new direction, I had worked with Mihai Pimsner,
                  computing the K-theory of the reduced $C^*$-algebras of free groups. From the
                  K-theory work I had acquired a taste for operator algebras associated with free
                  groups and I became interested in a famous problem about the von Neumann
                  algebras $L(mathbbF_n)$ generated by the left regular representations of free groups,
                  which appears in Kadison's Baton-Rouge problem list. The problem, which
                  may have already been known to Murray and von Neumann, is:are $L(mathbbF_m)$ and $L(mathbbF_n)$ non-isomorphic if $m not= n$?



                  This is still an open problem. Fortunately, after trying in vain to solve it,
                  I realized it was time to be more humble and to ask: is there anything I can
                  do, which may be useful in connection with this problem? Since I had come
                  across computations of norms and spectra of certain convolution operators on
                  free groups (i.e., elements of $L(mathbbF_n)$), I thought of finding ways to streamline
                  some of these computations and perhaps be able to compute more complicated
                  examples. This, of course, meant computing expectations of powers of such
                  operators with respect to the von Neumann trace-state $tau(T) = langle T e_e,e_erangle$, $e_g$
                  being the canonical basis of the $l^2$-space.



                  The key remark I made was that if $T_1$, $T_2$ are convolution operators on $mathbbF_m$
                  and $mathbbF_n$ then the operator on $mathbbF_m+n = mathbbF_m ast mathbbF_n$ which is $T_1 + T_2$, has moments $tau((T_1 + T_2)^p)$ which depend only on the moments $tau(T_j^k)$, $j = 1, 2$ , but not
                  on the actual $T_1$ and $T_2$. This was like the addition of independent random
                  variables, only classical independence had to be replaced by a notion of free
                  independence, which led to a free central limit theorem, a free analogue of
                  the Gaussian functor, free convolution, an abstract existence theorem for one
                  variable free cumulants, etc.








                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 6 hours ago









                  Tom CopelandTom Copeland

                  3,3621 gold badge27 silver badges51 bronze badges




                  3,3621 gold badge27 silver badges51 bronze badges














                  • $begingroup$
                    Good intro to the topic: "Three lectures on free probability" by Jonathan Novak and Michael LaCroix arxiv.org/abs/1205.2097
                    $endgroup$
                    – Tom Copeland
                    6 hours ago
















                  • $begingroup$
                    Good intro to the topic: "Three lectures on free probability" by Jonathan Novak and Michael LaCroix arxiv.org/abs/1205.2097
                    $endgroup$
                    – Tom Copeland
                    6 hours ago















                  $begingroup$
                  Good intro to the topic: "Three lectures on free probability" by Jonathan Novak and Michael LaCroix arxiv.org/abs/1205.2097
                  $endgroup$
                  – Tom Copeland
                  6 hours ago




                  $begingroup$
                  Good intro to the topic: "Three lectures on free probability" by Jonathan Novak and Michael LaCroix arxiv.org/abs/1205.2097
                  $endgroup$
                  – Tom Copeland
                  6 hours ago











                  1














                  $begingroup$

                  Logic and set theory were developed by Frege, Russell and Whitehead, Hilbert and others in the late 19th, early 20th centuries with the goal of providing a firm foundation for all of Mathematics. In this they failed miserably, but nevertheless they have continued to develop and to be studied for other reasons.






                  share|cite|improve this answer









                  $endgroup$



















                    1














                    $begingroup$

                    Logic and set theory were developed by Frege, Russell and Whitehead, Hilbert and others in the late 19th, early 20th centuries with the goal of providing a firm foundation for all of Mathematics. In this they failed miserably, but nevertheless they have continued to develop and to be studied for other reasons.






                    share|cite|improve this answer









                    $endgroup$

















                      1














                      1










                      1







                      $begingroup$

                      Logic and set theory were developed by Frege, Russell and Whitehead, Hilbert and others in the late 19th, early 20th centuries with the goal of providing a firm foundation for all of Mathematics. In this they failed miserably, but nevertheless they have continued to develop and to be studied for other reasons.






                      share|cite|improve this answer









                      $endgroup$



                      Logic and set theory were developed by Frege, Russell and Whitehead, Hilbert and others in the late 19th, early 20th centuries with the goal of providing a firm foundation for all of Mathematics. In this they failed miserably, but nevertheless they have continued to develop and to be studied for other reasons.







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered 2 hours ago









                      Gerry MyersonGerry Myerson

                      31.8k6 gold badges146 silver badges190 bronze badges




                      31.8k6 gold badges146 silver badges190 bronze badges
























                          1














                          $begingroup$

                          Multiplication of quaternions was introduced for use in physics for purposes for which cross-products of vectors came to be used and have been used ever since.



                          But today quaternions are used in computer graphics. I suspect they also have other applications.






                          share|cite|improve this answer









                          $endgroup$



















                            1














                            $begingroup$

                            Multiplication of quaternions was introduced for use in physics for purposes for which cross-products of vectors came to be used and have been used ever since.



                            But today quaternions are used in computer graphics. I suspect they also have other applications.






                            share|cite|improve this answer









                            $endgroup$

















                              1














                              1










                              1







                              $begingroup$

                              Multiplication of quaternions was introduced for use in physics for purposes for which cross-products of vectors came to be used and have been used ever since.



                              But today quaternions are used in computer graphics. I suspect they also have other applications.






                              share|cite|improve this answer









                              $endgroup$



                              Multiplication of quaternions was introduced for use in physics for purposes for which cross-products of vectors came to be used and have been used ever since.



                              But today quaternions are used in computer graphics. I suspect they also have other applications.







                              share|cite|improve this answer












                              share|cite|improve this answer



                              share|cite|improve this answer










                              answered 1 hour ago









                              Michael HardyMichael Hardy

                              5,8066 gold badges57 silver badges89 bronze badges




                              5,8066 gold badges57 silver badges89 bronze badges
























                                  1














                                  $begingroup$

                                  Ronald Fisher's theory of fiducial inference was introduced around 1930 or so (I think?), for the purpose of solving the Behrens–Fisher problem. It turned out that fiducial intervals for that problem did not have constant coverage rates, or in what then came to be standard terminology, they are not confidence intervals. That's not necessarily fatal in some contexts, since Bayesian credible intervals don't have constant coverage rates, but everyone understands that there are good reasons for that. Fisher wrote a paper saying that that criticism is unconvincing, and I wonder if anyone understands what Fisher was trying to say. Fisher was brilliant but irascible. (He was a very prolific author of research papers in statistical theory and in population genetics, a science of which he was one of the three major founders. I think he may have single-handedly founded the theory of design of experiments, but I'm not sure about that.)



                                  However, fiducial methods seem to be undergoing some sort of revival:



                                  https://statistics.fas.harvard.edu/event/4th-bayesian-fiducial-and-frequentist-conference-bff4






                                  share|cite|improve this answer









                                  $endgroup$



















                                    1














                                    $begingroup$

                                    Ronald Fisher's theory of fiducial inference was introduced around 1930 or so (I think?), for the purpose of solving the Behrens–Fisher problem. It turned out that fiducial intervals for that problem did not have constant coverage rates, or in what then came to be standard terminology, they are not confidence intervals. That's not necessarily fatal in some contexts, since Bayesian credible intervals don't have constant coverage rates, but everyone understands that there are good reasons for that. Fisher wrote a paper saying that that criticism is unconvincing, and I wonder if anyone understands what Fisher was trying to say. Fisher was brilliant but irascible. (He was a very prolific author of research papers in statistical theory and in population genetics, a science of which he was one of the three major founders. I think he may have single-handedly founded the theory of design of experiments, but I'm not sure about that.)



                                    However, fiducial methods seem to be undergoing some sort of revival:



                                    https://statistics.fas.harvard.edu/event/4th-bayesian-fiducial-and-frequentist-conference-bff4






                                    share|cite|improve this answer









                                    $endgroup$

















                                      1














                                      1










                                      1







                                      $begingroup$

                                      Ronald Fisher's theory of fiducial inference was introduced around 1930 or so (I think?), for the purpose of solving the Behrens–Fisher problem. It turned out that fiducial intervals for that problem did not have constant coverage rates, or in what then came to be standard terminology, they are not confidence intervals. That's not necessarily fatal in some contexts, since Bayesian credible intervals don't have constant coverage rates, but everyone understands that there are good reasons for that. Fisher wrote a paper saying that that criticism is unconvincing, and I wonder if anyone understands what Fisher was trying to say. Fisher was brilliant but irascible. (He was a very prolific author of research papers in statistical theory and in population genetics, a science of which he was one of the three major founders. I think he may have single-handedly founded the theory of design of experiments, but I'm not sure about that.)



                                      However, fiducial methods seem to be undergoing some sort of revival:



                                      https://statistics.fas.harvard.edu/event/4th-bayesian-fiducial-and-frequentist-conference-bff4






                                      share|cite|improve this answer









                                      $endgroup$



                                      Ronald Fisher's theory of fiducial inference was introduced around 1930 or so (I think?), for the purpose of solving the Behrens–Fisher problem. It turned out that fiducial intervals for that problem did not have constant coverage rates, or in what then came to be standard terminology, they are not confidence intervals. That's not necessarily fatal in some contexts, since Bayesian credible intervals don't have constant coverage rates, but everyone understands that there are good reasons for that. Fisher wrote a paper saying that that criticism is unconvincing, and I wonder if anyone understands what Fisher was trying to say. Fisher was brilliant but irascible. (He was a very prolific author of research papers in statistical theory and in population genetics, a science of which he was one of the three major founders. I think he may have single-handedly founded the theory of design of experiments, but I'm not sure about that.)



                                      However, fiducial methods seem to be undergoing some sort of revival:



                                      https://statistics.fas.harvard.edu/event/4th-bayesian-fiducial-and-frequentist-conference-bff4







                                      share|cite|improve this answer












                                      share|cite|improve this answer



                                      share|cite|improve this answer










                                      answered 1 hour ago









                                      Michael HardyMichael Hardy

                                      5,8066 gold badges57 silver badges89 bronze badges




                                      5,8066 gold badges57 silver badges89 bronze badges
























                                          0














                                          $begingroup$

                                          The typical oracle methods of Computability theory AKA Recursion theory were shown to be insufficient to settle the P vs. NP problem by Baker, Gill and Solovay 1975.



                                          Thus recursion theory became divorced from the problems of efficient computability and experienced a bit of a setback (not as many papers in Ann.Math. anymore etc.).



                                          Nevertheless it continued as the study of in principle computability.






                                          share|cite|improve this answer









                                          $endgroup$










                                          • 3




                                            $begingroup$
                                            Oracle methods predate the interest in or even formulation of P=NP. The failure of oracle methods for that problem surely highlighted the distance between computabilirt and efficient computation, but I don’t think the two subjects were ever very married.
                                            $endgroup$
                                            – Matt F.
                                            7 hours ago










                                          • $begingroup$
                                            @MattF. Fair enough but people became more interested in efficient computability than in-principle computability, because of practical applications.
                                            $endgroup$
                                            – Bjørn Kjos-Hanssen
                                            just now















                                          0














                                          $begingroup$

                                          The typical oracle methods of Computability theory AKA Recursion theory were shown to be insufficient to settle the P vs. NP problem by Baker, Gill and Solovay 1975.



                                          Thus recursion theory became divorced from the problems of efficient computability and experienced a bit of a setback (not as many papers in Ann.Math. anymore etc.).



                                          Nevertheless it continued as the study of in principle computability.






                                          share|cite|improve this answer









                                          $endgroup$










                                          • 3




                                            $begingroup$
                                            Oracle methods predate the interest in or even formulation of P=NP. The failure of oracle methods for that problem surely highlighted the distance between computabilirt and efficient computation, but I don’t think the two subjects were ever very married.
                                            $endgroup$
                                            – Matt F.
                                            7 hours ago










                                          • $begingroup$
                                            @MattF. Fair enough but people became more interested in efficient computability than in-principle computability, because of practical applications.
                                            $endgroup$
                                            – Bjørn Kjos-Hanssen
                                            just now













                                          0














                                          0










                                          0







                                          $begingroup$

                                          The typical oracle methods of Computability theory AKA Recursion theory were shown to be insufficient to settle the P vs. NP problem by Baker, Gill and Solovay 1975.



                                          Thus recursion theory became divorced from the problems of efficient computability and experienced a bit of a setback (not as many papers in Ann.Math. anymore etc.).



                                          Nevertheless it continued as the study of in principle computability.






                                          share|cite|improve this answer









                                          $endgroup$



                                          The typical oracle methods of Computability theory AKA Recursion theory were shown to be insufficient to settle the P vs. NP problem by Baker, Gill and Solovay 1975.



                                          Thus recursion theory became divorced from the problems of efficient computability and experienced a bit of a setback (not as many papers in Ann.Math. anymore etc.).



                                          Nevertheless it continued as the study of in principle computability.







                                          share|cite|improve this answer












                                          share|cite|improve this answer



                                          share|cite|improve this answer










                                          answered 8 hours ago









                                          Bjørn Kjos-HanssenBjørn Kjos-Hanssen

                                          18.6k3 gold badges39 silver badges89 bronze badges




                                          18.6k3 gold badges39 silver badges89 bronze badges










                                          • 3




                                            $begingroup$
                                            Oracle methods predate the interest in or even formulation of P=NP. The failure of oracle methods for that problem surely highlighted the distance between computabilirt and efficient computation, but I don’t think the two subjects were ever very married.
                                            $endgroup$
                                            – Matt F.
                                            7 hours ago










                                          • $begingroup$
                                            @MattF. Fair enough but people became more interested in efficient computability than in-principle computability, because of practical applications.
                                            $endgroup$
                                            – Bjørn Kjos-Hanssen
                                            just now












                                          • 3




                                            $begingroup$
                                            Oracle methods predate the interest in or even formulation of P=NP. The failure of oracle methods for that problem surely highlighted the distance between computabilirt and efficient computation, but I don’t think the two subjects were ever very married.
                                            $endgroup$
                                            – Matt F.
                                            7 hours ago










                                          • $begingroup$
                                            @MattF. Fair enough but people became more interested in efficient computability than in-principle computability, because of practical applications.
                                            $endgroup$
                                            – Bjørn Kjos-Hanssen
                                            just now







                                          3




                                          3




                                          $begingroup$
                                          Oracle methods predate the interest in or even formulation of P=NP. The failure of oracle methods for that problem surely highlighted the distance between computabilirt and efficient computation, but I don’t think the two subjects were ever very married.
                                          $endgroup$
                                          – Matt F.
                                          7 hours ago




                                          $begingroup$
                                          Oracle methods predate the interest in or even formulation of P=NP. The failure of oracle methods for that problem surely highlighted the distance between computabilirt and efficient computation, but I don’t think the two subjects were ever very married.
                                          $endgroup$
                                          – Matt F.
                                          7 hours ago












                                          $begingroup$
                                          @MattF. Fair enough but people became more interested in efficient computability than in-principle computability, because of practical applications.
                                          $endgroup$
                                          – Bjørn Kjos-Hanssen
                                          just now




                                          $begingroup$
                                          @MattF. Fair enough but people became more interested in efficient computability than in-principle computability, because of practical applications.
                                          $endgroup$
                                          – Bjørn Kjos-Hanssen
                                          just now


















                                          draft saved

                                          draft discarded















































                                          Thanks for contributing an answer to MathOverflow!


                                          • 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.




                                          draft saved


                                          draft discarded














                                          StackExchange.ready(
                                          function ()
                                          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f341959%2fexamples-of-unsuccessful-theories-with-afterlives%23new-answer', 'question_page');

                                          );

                                          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







                                          Popular posts from this blog

                                          ParseJSON using SSJSUsing AMPscript with SSJS ActivitiesHow to resubscribe a user in Marketing cloud using SSJS?Pulling Subscriber Status from Lists using SSJSRetrieving Emails using SSJSProblem in updating DE using SSJSUsing SSJS to send single email in Marketing CloudError adding EmailSendDefinition using SSJS

                                          Кампала Садржај Географија Географија Историја Становништво Привреда Партнерски градови Референце Спољашње везе Мени за навигацију0°11′ СГШ; 32°20′ ИГД / 0.18° СГШ; 32.34° ИГД / 0.18; 32.340°11′ СГШ; 32°20′ ИГД / 0.18° СГШ; 32.34° ИГД / 0.18; 32.34МедијиПодациЗванични веб-сајту

                                          19. јануар Садржај Догађаји Рођења Смрти Празници и дани сећања Види још Референце Мени за навигацијуу