Beardsley on literature, fiction, and nonfiction

This paper attempts to revive interest in the speech act theory of literature by looking into Monroe C. Beardsley's account in particular. Beardsley's view in this respect has received, surprisingly, less attention than deserved. I first offer a reconstruction of Beardsley's account and then use it to correct some notable misconceptions. Next, I show that the reformulation reveals a hitherto unnoticed discrepancy in Beardsley's position and that this can be explained away by a weak version of intentionalism that Beardsley himself actually tolerates. Finally, I assess the real difficulty of Beardsley's theory and its relevance today

Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester

Inspired by the Elitzur-Vaidman bomb testing problem [arXiv:hep-th/9305002], we introduce a new query complexity model, which we call bomb query complexity $B(f)$. We investigate its relationship with the usual quantum query complexity $Q(f)$, and show that $B(f)=\Theta(Q(f)^2)$. This result gives a new method to upper bound the quantum query complexity: we give a method of finding bomb query algorithms from classical algorithms, which then provide nonconstructive upper bounds on $Q(f)=\Theta(\sqrt{B(f)})$. We subsequently were able to give explicit quantum algorithms matching our upper bound method. We apply this method on the single-source shortest paths problem on unweighted graphs, obtaining an algorithm with $O(n^{1.5})$ quantum query complexity, improving the best known algorithm of $O(n^{1.5}\sqrt{\log n})$ [arXiv:quant-ph/0606127]. Applying this method to the maximum bipartite matching problem gives an $O(n^{1.75})$ algorithm, improving the best known trivial $O(n^2)$ upper bound.Comment: 32 pages. Minor revisions and corrections. Regev and Schiff's proof that P(OR) = \Omega(N) remove