<p>Tim Gowers is a fan of this kind of thing.  See specifically his exposition of <a href="http://gowers.files.wordpress.com/2009/05/razborov2.pdf">Razborov's method of approximations</a>.</p>

<p>In his introduction, Gowers references my <a href="http://alum.mit.edu/www/tchow/forcing.pdf">expository article on forcing</a>, which is a (not entirely successful) attempt to do the same thing for forcing.  Forcing is normally thought of as a technique in logic and set theory, but it has found its way into TCS occasionally.  It comes up in the study of bounded arithmetic and propositional proof complexity (Krajíček and Takeuti are two researchers who have pursued this connection), and the concept of a generic oracle is related to the concept of a generic filter.</p>

CC BY-SA 3.0
2011-11-09T15:53:16.733Z
2011-11-09T15:53:16.733Z
Timothy Chow
<p>Maybe authors don't include these failed attempts and the story of the research in their published papers because of the constraints imposed by editors and PC members. I guess it is very unusual for a journal (and probably even more unusual for a conference) to accept a paper where the main part of it is devoted to failed attempts. But in most cases if you talk with the authors or experts in the area they will explain story and the failed attempts (and many do talk about these in workshops). </p>

<p>I have seen several authors explain at lease where the ideas came from in their papers. As an example, Girard explains in his paper that the idea for linear logic came from trying to find a denotational semantics for intuitionistic OR. You can find this kind of information also in monographs and biographies of famous researchers and volumes devoted to them (<a href="http://en.wikipedia.org/wiki/Paul_Halmos">Halmos</a>'s autobiography and more recent "Kreiseliana: About and Around <a href="http://en.wikipedia.org/wiki/Georg_Kreisel">Georg Kreisel</a>" edited by Odifreddi came to mind, there are also volumes and articles dedicated to some complexity theorists). Hopefully more people will do what Ryan have done and systematically explain the process and tell the story.</p>

<p>ps: you can think of these as oral tradition of research :) (somewhat similar to <a href="http://en.wikipedia.org/wiki/Oral_Torah">Oral Torah</a> which was <a href="http://en.wikipedia.org/wiki/Oral_Torah#Prohibition_to_write_the_Oral_Torah">not allowed to be written down</a>). </p>

CC BY-SA 3.0
2011-11-09T01:17:20.327Z
thanks for the answer, although I wanted to avoid this kind of answers. I intentionally didn't ask for the reasons why this doesn't happen often. Also, note that I pointed to Ryan's result, because it's a "normal" paper, not a blog post, or a textbook or a biography.
Alessandro Cosentino
CC BY-SA 3.0
2011-11-09T01:39:25.483Z
@Alessandro, but you didn't avoid it: "I have always wondered why authors of paper don't write how they got to the proof, including the failed approaches they tried before getting to the track that led the solution." They do it, but usually not in journal papers (I think this kind of information is mainly interesting for junior researchers and students working in that particular topic). But I agree with you that reading papers which tell a story is more enjoyable. A few senior researchers advised me to do that, also in talks and presentations.
Kaveh
CC BY-SA 3.0
2011-11-09T01:45:56.740Z
There might be also other reasons that why including such information in journal articles would not be well-perceived by senior researchers (I have heard criticism from mathematicians about papers in TCS, they say that when reading TCS papers it feels like we are over-advertising our results, it seems that they like it the other way more). (By the way, correct me if I am wrong but I think Ryan's article is not published yet.)
Kaveh
CC BY-SA 3.0
2011-11-09T03:12:44.633Z
@Kaveh: the ArXiv version is an expansion of a paper in the Sept 2011 SIGACT News.
Aaron Sterling
CC BY-SA 3.0
2011-11-09T06:46:11.403Z
Sanjeev Arora once said in a talk that he started out trying to prove PCP hardness for Euclidean TSP, and the failure to do so led him to a PTAS.
Suresh Venkat
CC BY-SA 3.0
2011-11-09T06:55:19.630Z
I've found that readers are often happier when I leave out the failures, because keeping track of which techniques are important and which are red herrings adds an additional layer of difficulty to reading the paper. It's harder, but better, to find an intuitive story which leads directly to the correct solution --- even if you didn't think up the story until *after* you found the proof.
Neel Krishnaswami
CC BY-SA 3.0
2011-11-09T12:28:13.290Z
@Kaveh: you are right, I've wondered that, but I didn't ask an explicit question about it to not trigger a debate. From CST.SE, I just care to know about examples where published "casual tours" are described. The debate is very interesting, but it would fit better in a forum rather than here.
Alessandro Cosentino
CC BY-SA 3.0
2011-11-09T16:01:19.363Z
@Alessandro, I completely agree with you that "[a debate] would fit better in a forum rather than here". I didn't meant to start a debate, they were side-remarks answering yours. My answer was that Girard does tell about the story in his papers.
Kaveh
CC BY-SA 3.0
2011-11-09T00:25:12.207Z
2011-11-09T00:25:12.207Z
Kaveh
<p>There is a published <a href="http://dx.doi.org/10.1109/SCT.1990.113952">paper</a> by Laszlo Babai (1990) in the form of a fable about Arthur and Merlin describing the dramatic sequence of events leading the community up to the IP=PSPACE result in 1989, which was very much unbelievable just a year earlier.</p>

CC BY-SA 3.0
2011-11-09T06:42:16.007Z
2011-11-09T06:42:16.007Z
Martin Schwarz
<p>(This started out as a comment and got way way way too long). </p>

<p>You may enjoy William Thurston's article <a href="http://arxiv.org/abs/math/9404236">On Proof and Progress in Mathematics</a>. </p>

<blockquote>
  <p>Mathematics in some sense has a common language: a language of symbols, technical definitions, computations, and logic. This language efficiently conveys some, but not all, modes of mathematical thinking. Mathematicians learn to translate certain things almost unconsciously from one mental mode to the other, so that some statements quickly become clear. [...] </p>
  
  <p>People familiar with ways of doing things in a subfield recognize various patterns of statements or formulas as idioms or circumlocution for certain concepts or mental images. But to people not already familiar with what’s going on the same patterns are not very illuminating; they are often even misleading. The language is not alive except to those who use it. [...]</p>
  
  <p>We mathematicians need to put far greater effort into communicating mathematical ideas. To accomplish this, we need to pay much more attention to communicating not just our definitions, theorems, and proofs, but also our ways of thinking. We need to appreciate the value of different ways of thinking about the same mathematical structure.
  We need to focus far more energy on understanding and explaining the basic mental infrastructure of mathematics—with consequently less energy on the most recent results. This entails developing mathematical language that is effective for the radical purpose of conveying ideas to people who don’t already know them.</p>
</blockquote>

<p>Regarding the original question, there are papers that do not present ideas in the Definition-Theorem-Proof (DTP) format. Timothy Chow has a few papers that focus on communicating ideas (though they are not the first (or second) papers on the topic/result). </p>

<ol>
<li><a href="http://www.ams.org/notices/200601/fea-chow.pdf">You could have invented spectral sequences</a>, Timothy Chow, Notices of the AMS</li>
<li><a href="http://www-math.mit.edu/~tchow/mathstuff/forcingdum">Forcing for dummies</a>, Timothy Chow</li>
</ol>

<p>One possible reason for the prevalence of the DTP format is that we are all just used to it from books and papers. Reviewers (and readers) sometimes find non-standard writing style distracting. A middle ground is papers that gently break the reader into a result. There are papers that present a special case or a simple problem that illustrates the general idea.</p>

<ol>
<li><a href="http://www.google.com/url?sa=t&amp;rct=j&amp;q=the%2btopological%2bstructure%2bof%2basynchronous%2bcomputability&amp;source=web&amp;cd=3&amp;ved=0CDYQFjAC&amp;url=http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.78.1455&amp;rep=rep1&amp;type=pdf&amp;ei=35e6TsKrM8XVrQe5rp3QBg&amp;usg=AFQjCNH_TSl4tQhAyMDNZ_-rcSLEDmJxTg&amp;cad=rja">The Topological Structure of Asynchronous Computability</a>, Maurice Herlihy and Nir Shavit. The paper has many illustrations and demonstrates the general idea for a simple protocol before applying the main theorem to solve some open problems.</li>
<li><a href="http://www.google.com/url?sa=t&amp;rct=j&amp;q=logic%20and%20p-recognizable%20sets%20of%20integers&amp;source=web&amp;cd=1&amp;ved=0CBoQFjAA&amp;url=http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.67.7581&amp;rep=rep1&amp;type=pdf&amp;ei=kZi6Ttj0MsHHrQe9s_W2Bg&amp;usg=AFQjCNEfaiSmm5CGCFEhx8iHRRdIQ8U4OA&amp;cad=rja">Logic and $p$ recognizable sets of integers</a>, Véronique Bruyàre, Georges Hansel, Christian Michaux, and Roger Villemaire. A survey-style exposition of a  beautiful result: the sets of natural numbers that are encodable by finite automata, independent of the base chosen are precisely those definable in Presburger arithmetic. The paper has numerous examples, covers special cases before the general case and provides historical background about erroneous proof attempts. </li>
</ol>

<p>No discussion of a non-standard presentation of remarkable ideas would be complete without mentioning the work of <a href="http://iml.univ-mrs.fr/~girard/Articles.html">Jean-Yves Girard</a>. Unique is probably the best word to describe it (without being diplomatic or sarcastic). From, the paper <a href="http://iml.univ-mrs.fr/~girard/linear.pdf">Linear Logic</a>.</p>

<blockquote>
  <p>The philosophical exegesis of Heyting’s rules leaves in fact very little room for a further discussion of the intuitionistic calculus; but has anybody ever seriously tried? In fact, linear logic, which is a clear and clean extension of usual logic, can be reached through a more perspicuous analysis of the semantics of proofs (not very far from the computer-science approach and thus relegated to the next section), or by certain more or less immediate considerations about sequent calculus. These considerations are of immediate geometrical meaning, but in order to understand them, one has to forget the intentions, remembering, with a Chinese leader, that it’s not the colour of the cat that matters, but the fact that it catches mice.</p>
</blockquote>

<p>Later:</p>

<blockquote>
  <p>There are still people saying that , in order to make computer science, one essentially needs a soldering iron; this opinion is shared by logicians who despise computer science and by engineers who despise theoreticians. However, in recent years, the need for a logical study of programmation has become clearer and clearer and the linkage logic-computer-science seems irreversible.
  [...]<br>
   In some sense , logic plays the same role as the one played by geometry w.r.t. physics: the geometrical frame imposes certain conservation results, for instance, the Stokes formula. The symmetries of logic presumably express deep conservation of information, in form which have not yet been rightly conceptualised. </p>
</blockquote>

CC BY-SA 3.0
2011-11-09T16:43:33.070Z
Another point is that the DTP style is a common baseline. No matter how you think about the intuition to a problem, there's an "objective" DTP version of a proof. However, intuition itself is very subjective, and my explanation of how I think about a problem might not work for someone else, especially for deep results that admit many interpretations.
Suresh Venkat
CC BY-SA 3.0
2011-11-11T07:54:44.303Z
"...in recent years, the need for a logical study of programmation has become clearer and clearer and the linkage logic-computer-science seems irreversible..."

http://dewey.info/class/00/about.en 000 Computer science, information & general works 000 Computer science, knowledge & systems Not a coincidence.
Kris
CC BY-SA 3.0
2011-11-09T16:06:54.640Z
2011-11-09T16:06:54.640Z
Vijay D
<p>There is a <a href="http://arxiv.org/abs/quant-ph/0109116">paper</a> (2001) of similar style by Lov Grover, which describes the way to his breakthrough <a href="http://arxiv.org/abs/quant-ph/9605043">quantum search algorithm</a> (1996).</p>

CC BY-SA 3.0
2011-11-09T00:09:15.623Z
nice! I was hoping to see an example from QC.
Alessandro Cosentino
CC BY-SA 3.0
2011-11-08T23:25:26.287Z
2011-11-08T23:25:26.287Z
Martin Schwarz
<p>Today Ryan Williams posted an <a href="http://arxiv.org/abs/1111.1261">article</a> on the arXiv (previously appeared in SIGACT News) containing a less technical version of his recent <em>ACC</em> lower bound technique.</p>

<p>My question is not about the technique itself (of course worthy of immense praise), but it's about the style of the paper.
In the abstract, he writes: </p>

<blockquote>
  <p>The proof will be described from the perspective of someone trying to
  discover it.</p>
</blockquote>

<p>Awesome!
In the Background section he adds:</p>

<blockquote>
  <p>This article is a discussion about how to discover the proof – a
  casual tour around it. Not all details will be given, but you will see
  where all the pieces came from, and how they ﬁt together. The path
  will be littered with my own biased intuitions about complexity theory
  – what I think should and shouldn’t be true, and why. Much of this
  intuition may well be wrong; however I can say it has led me in a
  productive direction on at least one occasion.</p>
</blockquote>

<p>This is amazing and it's the first time that I have seen it. I have always wondered why authors of paper don't write how they got to the proof, including the failed approaches they tried before getting to the track that led the solution. When I saw Ryan's paper on the arXiv, I felt very motivated to read it. 
I consider it a revolutionary paper from this point of view. Most of the time the only thing you can do with a paper is verifying its correctness.</p>

<p>The question is the following:</p>

<ul>
<li>are you aware of other papers in TCS where a breakthrough result is presented in a "casual tour" rather than a series of technical lemmas?</li>
</ul>

<p>I am talking about publications in journals, not blog posts or technical reports.</p>

<p>Also, I tagged it as <a href="/questions/tagged/big-list" class="post-tag" title="show questions tagged 'big-list'" rel="tag">big-list</a>, with the hope that it will actually be.</p>

CC BY-SA 3.0
2011-11-08T23:29:11.447Z
As a side point, I had an email exchange with Ryan today about writing a post about this paper for the CSTheory Community Blog.  My current plan is to write it sometime next week.  However, Alessandro, if you are motivated by the paper and would like to do so, please do let me know. :-)
Aaron Sterling
CC BY-SA 3.0
2011-11-09T00:21:36.543Z
I know you don't want blog posts, but Andrew Drucker's plausible reconstruction of the discovery process behind Valiant-Vazirani theorem is really nice: http://andysresearch.blogspot.com/2007/06/paths-to-discovery-valiant-vazirani.html
didest
CC BY-SA 3.0
2011-11-09T04:34:22.677Z
Great question, Alessandro!
Michal Kotowski
CC BY-SA 3.0
2011-11-09T16:15:54.773Z
For *expository articles*, see also this MO question: [Which journals publish expository work?](http://mathoverflow.net/questions/15366/which-journals-publish-expository-work)
Kaveh
CC BY-SA 3.0
2011-11-11T13:53:58.440Z
I accepted Martin Schwarz's answer because the paper he pointed out is exactly in the style of Ryan Williams's paper: a pedagogical version of a breakthrough result, written by the author himself and published in a journal. Also, I've got this reply after 30 sec :) I thank Martin and everybody for answers and comments.
Alessandro Cosentino
CC BY-SA 3.0
2011-11-11T13:56:28.813Z
Also, I had an email exchange with @AaronSterling and we agreed that I am going to write the blog post during the Christmas break.
Alessandro Cosentino
<soft-question><big-list>
Casual tours around proofs
Alessandro Cosentino
# Casual tours around proofs

(Asked by: username_0 on 2011-11-08)

Today Ryan Williams posted an [article](http://arxiv.org/abs/1111.1261) on the arXiv (previously appeared in SIGACT News) containing a less technical version of his recent *ACC* lower bound technique.

My question is not about the technique itself (of course worthy of immense praise), but it's about the style of the paper.
In the abstract, he writes:

> The proof will be described from the perspective of someone trying to
> discover it.

Awesome!
In the Background section he adds:

> This article is a discussion about how to discover the proof – a
> casual tour around it. Not all details will be given, but you will see
> where all the pieces came from, and how they ﬁt together. The path
> will be littered with my own biased intuitions about complexity theory
> – what I think should and shouldn’t be true, and why. Much of this
> intuition may well be wrong; however I can say it has led me in a
> productive direction on at least one occasion.

This is amazing and it's the first time that I have seen it. I have always wondered why authors of paper don't write how they got to the proof, including the failed approaches they tried before getting to the track that led the solution. When I saw Ryan's paper on the arXiv, I felt very motivated to read it.
I consider it a revolutionary paper from this point of view. Most of the time the only thing you can do with a paper is verifying its correctness.

The question is the following:

* are you aware of other papers in TCS where a breakthrough result is presented in a "casual tour" rather than a series of technical lemmas?

I am talking about publications in journals, not blog posts or technical reports.

Also, I tagged it as [big-list](/questions/tagged/big-list "show questions tagged 'big-list'"), with the hope that it will actually be.

**Tags:** soft-question, big-list

> **Comments:**
> **username_1**: As a side point, I had an email exchange with Ryan today about writing a post about this paper for the CSTheory Community Blog.  My current plan is to write it sometime next week.  However, Alessandro, if you are motivated by the paper and would like to do so, please do let me know. :-)  
> **username_2**: I know you don't want blog posts, but Andrew Drucker's plausible reconstruction of the discovery process behind Valiant-Vazirani theorem is really nice: http://andysresearch.blogspot.com/2007/06/paths-to-discovery-valiant-vazirani.html  
> **username_3**: Great question, Alessandro!  
> **username_4**: For *expository articles*, see also this MO question: [Which journals publish expository work?](http://mathoverflow.net/questions/15366/which-journals-publish-expository-work)  
> **username_0**: I accepted username_8's answer because the paper he pointed out is exactly in the style of Ryan Williams's paper: a pedagogical version of a breakthrough result, written by the author himself and published in a journal. Also, I've got this reply after 30 sec :) I thank Martin and everybody for answers and comments.  
> **username_0**: Also, I had an email exchange with @AaronSterling and we agreed that I am going to write the blog post during the Christmas break.  

---

## 5 answers

### Answer by username_8 on 2011-11-08. Score: 17 | Accepted answer

There is a [paper](http://arxiv.org/abs/quant-ph/0109116) (2001) of similar style by Lov Grover, which describes the way to his breakthrough [quantum search algorithm](http://arxiv.org/abs/quant-ph/9605043) (1996).

> **Comments:**
> **username_0**: nice! I was hoping to see an example from QC.  

---

### Answer by username_5 on 2011-11-09. Score: 18

Tim Gowers is a fan of this kind of thing. See specifically his exposition of [Razborov's method of approximations](http://gowers.files.wordpress.com/2009/05/razborov2.pdf).

In his introduction, Gowers references my [expository article on forcing](http://alum.mit.edu/www/tchow/forcing.pdf), which is a (not entirely successful) attempt to do the same thing for forcing. Forcing is normally thought of as a technique in logic and set theory, but it has found its way into TCS occasionally. It comes up in the study of bounded arithmetic and propositional proof complexity (Krajíček and Takeuti are two researchers who have pursued this connection), and the concept of a generic oracle is related to the concept of a generic filter.


---

### Answer by username_9 on 2011-11-09. Score: 15

(This started out as a comment and got way way way too long).

You may enjoy William Thurston's article [On Proof and Progress in Mathematics](http://arxiv.org/abs/math/9404236).

> Mathematics in some sense has a common language: a language of symbols, technical definitions, computations, and logic. This language efficiently conveys some, but not all, modes of mathematical thinking. Mathematicians learn to translate certain things almost unconsciously from one mental mode to the other, so that some statements quickly become clear. [...]
>
> People familiar with ways of doing things in a subfield recognize various patterns of statements or formulas as idioms or circumlocution for certain concepts or mental images. But to people not already familiar with what’s going on the same patterns are not very illuminating; they are often even misleading. The language is not alive except to those who use it. [...]
>
> We mathematicians need to put far greater effort into communicating mathematical ideas. To accomplish this, we need to pay much more attention to communicating not just our definitions, theorems, and proofs, but also our ways of thinking. We need to appreciate the value of different ways of thinking about the same mathematical structure.
> We need to focus far more energy on understanding and explaining the basic mental infrastructure of mathematics—with consequently less energy on the most recent results. This entails developing mathematical language that is effective for the radical purpose of conveying ideas to people who don’t already know them.

Regarding the original question, there are papers that do not present ideas in the Definition-Theorem-Proof (DTP) format. username_5 has a few papers that focus on communicating ideas (though they are not the first (or second) papers on the topic/result).

1. [You could have invented spectral sequences](http://www.ams.org/notices/200601/fea-chow.pdf), username_5, Notices of the AMS
2. [Forcing for dummies](http://www-math.mit.edu/~tchow/mathstuff/forcingdum), username_5

One possible reason for the prevalence of the DTP format is that we are all just used to it from books and papers. Reviewers (and readers) sometimes find non-standard writing style distracting. A middle ground is papers that gently break the reader into a result. There are papers that present a special case or a simple problem that illustrates the general idea.

1. [The Topological Structure of Asynchronous Computability](http://www.google.com/url?sa=t&rct=j&q=the%2btopological%2bstructure%2bof%2basynchronous%2bcomputability&source=web&cd=3&ved=0CDYQFjAC&url=http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.78.1455&rep=rep1&type=pdf&ei=35e6TsKrM8XVrQe5rp3QBg&usg=AFQjCNH_TSl4tQhAyMDNZ_-rcSLEDmJxTg&cad=rja), Maurice Herlihy and Nir Shavit. The paper has many illustrations and demonstrates the general idea for a simple protocol before applying the main theorem to solve some open problems.
2. [Logic and $p$ recognizable sets of integers](http://www.google.com/url?sa=t&rct=j&q=logic%20and%20p-recognizable%20sets%20of%20integers&source=web&cd=1&ved=0CBoQFjAA&url=http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.67.7581&rep=rep1&type=pdf&ei=kZi6Ttj0MsHHrQe9s_W2Bg&usg=AFQjCNEfaiSmm5CGCFEhx8iHRRdIQ8U4OA&cad=rja), Véronique Bruyàre, Georges Hansel, Christian Michaux, and Roger Villemaire. A survey-style exposition of a beautiful result: the sets of natural numbers that are encodable by finite automata, independent of the base chosen are precisely those definable in Presburger arithmetic. The paper has numerous examples, covers special cases before the general case and provides historical background about erroneous proof attempts.

No discussion of a non-standard presentation of remarkable ideas would be complete without mentioning the work of [Jean-Yves Girard](http://iml.univ-mrs.fr/~girard/Articles.html). Unique is probably the best word to describe it (without being diplomatic or sarcastic). From, the paper [Linear Logic](http://iml.univ-mrs.fr/~girard/linear.pdf).

> The philosophical exegesis of Heyting’s rules leaves in fact very little room for a further discussion of the intuitionistic calculus; but has anybody ever seriously tried? In fact, linear logic, which is a clear and clean extension of usual logic, can be reached through a more perspicuous analysis of the semantics of proofs (not very far from the computer-science approach and thus relegated to the next section), or by certain more or less immediate considerations about sequent calculus. These considerations are of immediate geometrical meaning, but in order to understand them, one has to forget the intentions, remembering, with a Chinese leader, that it’s not the colour of the cat that matters, but the fact that it catches mice.

Later:

> There are still people saying that , in order to make computer science, one essentially needs a soldering iron; this opinion is shared by logicians who despise computer science and by engineers who despise theoreticians. However, in recent years, the need for a logical study of programmation has become clearer and clearer and the linkage logic-computer-science seems irreversible.
> [...]  
> In some sense , logic plays the same role as the one played by geometry w.r.t. physics: the geometrical frame imposes certain conservation results, for instance, the Stokes formula. The symmetries of logic presumably express deep conservation of information, in form which have not yet been rightly conceptualised.

> **Comments:**
> **username_6**: Another point is that the DTP style is a common baseline. No matter how you think about the intuition to a problem, there's an "objective" DTP version of a proof. However, intuition itself is very subjective, and my explanation of how I think about a problem might not work for someone else, especially for deep results that admit many interpretations.  
> **username_10**: "...in recent years, the need for a logical study of programmation has become clearer and clearer and the linkage logic-computer-science seems irreversible..."  http://dewey.info/class/00/about.en 000 Computer science, information & general works 000 Computer science, knowledge & systems Not a coincidence.  

---

### Answer by username_4 on 2011-11-09. Score: 12

Maybe authors don't include these failed attempts and the story of the research in their published papers because of the constraints imposed by editors and PC members. I guess it is very unusual for a journal (and probably even more unusual for a conference) to accept a paper where the main part of it is devoted to failed attempts. But in most cases if you talk with the authors or experts in the area they will explain story and the failed attempts (and many do talk about these in workshops).

I have seen several authors explain at lease where the ideas came from in their papers. As an example, Girard explains in his paper that the idea for linear logic came from trying to find a denotational semantics for intuitionistic OR. You can find this kind of information also in monographs and biographies of famous researchers and volumes devoted to them ([Halmos](http://en.wikipedia.org/wiki/Paul_Halmos)'s autobiography and more recent "Kreiseliana: About and Around [Georg Kreisel](http://en.wikipedia.org/wiki/Georg_Kreisel)" edited by Odifreddi came to mind, there are also volumes and articles dedicated to some complexity theorists). Hopefully more people will do what Ryan have done and systematically explain the process and tell the story.

ps: you can think of these as oral tradition of research :) (somewhat similar to [Oral Torah](http://en.wikipedia.org/wiki/Oral_Torah) which was [not allowed to be written down](http://en.wikipedia.org/wiki/Oral_Torah#Prohibition_to_write_the_Oral_Torah)).

> **Comments:**
> **username_0**: thanks for the answer, although I wanted to avoid this kind of answers. I intentionally didn't ask for the reasons why this doesn't happen often. Also, note that I pointed to Ryan's result, because it's a "normal" paper, not a blog post, or a textbook or a biography.  
> **username_4**: @Alessandro, but you didn't avoid it: "I have always wondered why authors of paper don't write how they got to the proof, including the failed approaches they tried before getting to the track that led the solution." They do it, but usually not in journal papers (I think this kind of information is mainly interesting for junior researchers and students working in that particular topic). But I agree with you that reading papers which tell a story is more enjoyable. A few senior researchers advised me to do that, also in talks and presentations.  
> **username_4**: There might be also other reasons that why including such information in journal articles would not be well-perceived by senior researchers (I have heard criticism from mathematicians about papers in TCS, they say that when reading TCS papers it feels like we are over-advertising our results, it seems that they like it the other way more). (By the way, correct me if I am wrong but I think Ryan's article is not published yet.)  
> **username_1**: @username_4: the ArXiv version is an expansion of a paper in the Sept 2011 SIGACT News.  
> **username_6**: Sanjeev Arora once said in a talk that he started out trying to prove PCP hardness for Euclidean TSP, and the failure to do so led him to a PTAS.  
> **username_7**: I've found that readers are often happier when I leave out the failures, because keeping track of which techniques are important and which are red herrings adds an additional layer of difficulty to reading the paper. It's harder, but better, to find an intuitive story which leads directly to the correct solution --- even if you didn't think up the story until *after* you found the proof.  
> **username_0**: @username_4: you are right, I've wondered that, but I didn't ask an explicit question about it to not trigger a debate. From CST.SE, I just care to know about examples where published "casual tours" are described. The debate is very interesting, but it would fit better in a forum rather than here.  
> **username_4**: @Alessandro, I completely agree with you that "[a debate] would fit better in a forum rather than here". I didn't meant to start a debate, they were side-remarks answering yours. My answer was that Girard does tell about the story in his papers.  

---

### Answer by username_8 on 2011-11-09. Score: 11

There is a published [paper](http://dx.doi.org/10.1109/SCT.1990.113952) by Laszlo Babai (1990) in the form of a fable about Arthur and Merlin describing the dramatic sequence of events leading the community up to the IP=PSPACE result in 1989, which was very much unbelievable just a year earlier.


---

