9 ms·
Source of the famous “Now you have two problems” quote (2006)
- sparky_z 11y agoSome people, when confronted with a problem, think “I know, I'll use the Banach–Tarski Theorem.”
- shoo 11y agoNow they have their original problem (assumed to contain a sphere), an additional sphere, and a dependency upon the axiom of choice.
- jordigh 11y agoTrue story, did you know you can have paradoxical sets without choice? You just need infinity. https://en.wikipedia.org/wiki/Paradoxical_set https://en.wikipedia.org/wiki/Paradoxical_set http://www.math.hmc.edu/~su/papers.dir/banachtarski.pdf http://www.math.hmc.edu/~su/papers.dir/banachtarski.pdf
- JadeNB 11y agoWhile I don't dispute your claim, neither of the links substantiates it. The Wikipedia article says that you only need the axiom of infinity, but mentions only Banach–Tarski (which does require choice); and the minor thesis says on p. 2 that "the philosophy adopted in ths paper will be the unquestioned acceptance of Choice as a useful foundation in our work". Do you have any other references for this? (I'm interested, not snarking.)
- jordigh 11y agoThe paper is kind of long. Look at Theorem 4 in it. https://www.math.hmc.edu/funfacts/ffiles/30001.1-2-8.shtml https://www.math.hmc.edu/funfacts/ffiles/30001.1-2-8.shtml
- nicklaf 11y agoIt really bothers me that Google has allowed groups to deteriorate so much. At one time, it was actually a decent archive of Usenet history, but since then, search has deteriorated, and apparently, posts are sometimes missing. Perhaps the people who are now famous that posted on Usenet back then didn't want posts from their college days in the spotlight, and their friends at Google implicitly let the site go to hell. </conspiracy-theory> Edit: Hmm, I may be wrong. A while back, many of the links in this list of "memorable Usenet moments" [1] were broken, but they seem to work now. Edit #2: Okay, I was not wrong. For example, take a look at the link on that page to "December 1982: First thread about AIDS" [2]. The link takes you to a Usenet post that doesn't even mention AIDS, in the newsgroup fa.telecom. [1] https://support.google.com/groups/answer/6003482?hl=en https://support.google.com/groups/answer/6003482?hl=en [2] https://groups.google.com/forum/#!msg/fa.telecom/EmQ-s_EGgSA/Jq6xiaLM8ncJ https://groups.google.com/forum/#!msg/fa.telecom/EmQ-s_EGgSA...
- deleted 11y ago[deleted]
- magicalist 11y ago> Edit #2: Okay, I was not wrong. For example, take a look at the link on that page to "December 1982: First thread about AIDS" [2]. The link takes you to a Usenet post that doesn't even mention AIDS, in the newsgroup fa.telecom. I think that help article is just messed up. That section of the list seems to be doing something weird with the permalinks. The full links still work....just see e.g. the link in this 2002 metafilter post about the AIDS post. Still works: http://www.metafilter.com/22004/First-mention-of-AIDS-on-Usenet http://www.metafilter.com/22004/First-mention-of-AIDS-on-Use... edit: though it's worth noting every other link in that list I've tried (even the ones with the weird permalinks) has worked correctly so far
- toothbrush 11y agoThat thread seems largely incomplete though. It contains 4 posts on Google Groups, but notice how the comments on MetaFilter seem to refer to more.
- 11y ago
- paulsutter 11y agoI was confronted with a problem, so I thought I would use Java. Now I have a problem factory.
- icelancer 11y agojava.classes.factories.problem.module
- evilotto 11y agoWhen all you have is a HammerFactoryImpl, every problem looks like an INailIter
- arethuza 11y agoWhy restrict things to Hammer and Nails - you need to abstract that a bit further. Why not IDirectedForceApplier and IDirectedForceRecipientIter :-) Maybe they should introduce a "Name not sufficently abstract" syntax error into the Java compiler! :-)
- deleted 11y ago[deleted]
- yoz-y 11y agoOf course the currently trending answer would be to use monads. Preferably implemented in Go.
- arethuza 11y agoI remember a colleague who wrote Common Lisp in the style of Occam - with concurrent process and communication channels. His code actually looked a lot like some Go code I've seen - hardly surprising I guess given the common ancestry to CSP.
- lispm 11y agoBtw., CSP in Hoare's Book is a Lisp... http://www.usingcsp.com/cspbook.pdf http://www.usingcsp.com/cspbook.pdf Page vi: > The proposed implementations are unusual in that they use a very simple purely functional subset of the well-known programming language LISP. This will afford additional excitement to those who have access to a LISP implementation on which to exercise and demonstrate their designs.
- Tloewald 11y agoIt's as versatile a joke as the old Slashdot Meme (apparently originally from South Park, which I did not know): 1. Do some stupid thing 2. ???? 3. PROFIT! In fact: 1. Use regexp 2. ???? 3. PROFIT! http://knowyourmeme.com/memes/profit http://knowyourmeme.com/memes/profit (While we're at it: I had a problem and decided to use regexp. Now I have two first world problems.)
- jackgavigan 11y agoThe South Park underwear gnomes joke was a parody of dot-com startups (i.e. around 1999/2000) who didn't have a clear business model. https://www.youtube.com/watch?v=tO5sxLapAts https://www.youtube.com/watch?v=tO5sxLapAts
- SmellyGeekBoy 11y agoInteresting that the 1999/2000 dot-com crowd were aiming to turn a profit eventually, even if they didn't know how. Seems like even that isn't a requirement in the current bubble... ;)
- Tloewald 11y agoAccording to the linked article the episode was from 1998, which actually makes it fairly early in the game even for poking fun at stupid dotcom sites.
- dfrey 11y agoThe modern version: 1) Acquire millions of users 2) Get acquired for billions of dollars 3) Not my problem
- nailer 11y agoKeep in mind at the time people were using regexs for tree structures like the DOM, and calculating time. Manipulating the DOM with regexs generally known to be impossible these days, and using regexs for time only happens on the Unix command line where there aren't better alternatives.
- eli 11y agoI assure you that people are still manipulating DOM with regexes.
- icelancer 11y agoTime for the classic bobince Stack Overflow post: http://stackoverflow.com/questions/1732348/regex-match-open-tags-except-xhtml-self-contained-tags http://stackoverflow.com/questions/1732348/regex-match-open-...
- dansingerman 11y agoI know this is a famous meme, but why, in response, does no one mention that sizzle, the selector engine in jQuery is based on regexes? (https://github.com/jquery/sizzle/blob/master/src/sizzle.js https://github.com/jquery/sizzle/blob/master/src/sizzle.js) It suggests to me a very large proportion of DOM parsing code in existence uses regexes.
- tsotha 11y agoThat's one of my favorite pages in all the internet.
- deleted 11y ago[deleted]
- cannam 11y agoI enjoyed some of the remarks about Postscript in the comments, particularly this one http://regex.info/blog/2006-09-15/247#comment-18269 http://regex.info/blog/2006-09-15/247#comment-18269 with its link to "a C-like syntax to PS compiler... called PdB" (http://compilers.iecc.com/comparch/article/93-01-152 http://compilers.iecc.com/comparch/article/93-01-152). Some of the binaries for PdB appear to be still available, but it looks as if the source was never published? I like the idea of an alternate world in which Postscript, rather than Javascript, became the new universal "assembly language" for compilers to target. I imagine that may have been what Sun were aiming for with their Network Extensible Window System (https://en.wikipedia.org/wiki/NeWS https://en.wikipedia.org/wiki/NeWS). My only encounter with that was via Xnews, about which I remember little except that it was very slow.
- arethuza 11y agoPdB = "Pure dead Brilliant" = "awesome" Quite a remarkable bit of code that - I loved HyperNeWS.
- DonHopkins 11y agoArthur van Hoff wrote PdB, and we used it for to develop HyperLook (nee HyperNeWS nee GoodNeWS). You could actually subclass PostScript classes in C, and vice-verse! I still have source code of PdB, although you'll have to ask Arthur for permission if you want a copy. I wrote a PostScript "pretty plotter" in PostScript -- actually an interactive visual programming environment and debugger for NeWS: http://www.donhopkins.com/drupal/node/97 http://www.donhopkins.com/drupal/node/97 Check out the NFS version 3 spec (NeFS) -- sorry but the pages are ordered backwards for some reason (well it is based on PostScript): http://www.donhopkins.com/home/nfs3_0.pdf http://www.donhopkins.com/home/nfs3_0.pdf The Network Extensible File System protocol(NeFS) provides transparent remote access to shared file systems over networks. The NeFS protocol is designed to be machine, operating system, network architecture, and transport protocol independent. This document is the draft specification for the protocol. It will remain in draft form during a period of public review. Italicized comments in the document are intended to present the rationale behind elements of the design and to raise questions where there are doubts. Comments and suggestions on this draft specification are most welcome. The Network File System The Network File System (NFS™* ) has become a de facto standard distributed file system. Since it was first made generally available in 1985 it has been licensed by more than 120 companies. If the NFS protocol has been so successful why does there need to be NeFS ? Because the NFS protocol has deficiencies and limitations that become more apparent and troublesome as it grows older. 1. Size limitations. The NFS version 2 protocol limits filehandles to 32 bytes, file sizes to the magnitude of a signed 32 bit integer, timestamp accuracy to 1 second. These and other limits need to be extended to cope with current and future demands. 2. Non-idempotent procedures. A significant number of the NFS procedures are not idempotent. In certain circumstances these procedures can fail unexpectedly if retried by the client. It is not always clear how the client should recover from such a failure. 3. Unix®† bias. The NFS protocol was designed and first implemented in a Unix environment. This bias is reflected in the protocol: there is no support for record-oriented files, file versions or non-Unix file attributes. This bias must be removed if NFS is to be truly machine and operating system independent. 4. No access procedure. Numerous security problems and program anomalies are attributable to the fact that clients have no facility to ask a server whether they have permission to carry out certain operations. 5. No facility to support atomic filesystem operations. For instance the POSIX O_EXCL flag makes a requirement for exclusive file creation. This cannot be guaranteed to work via the NFS protocol without the support of an auxiliary locking service. Similarly there is no way for a client to guarantee that data written to a file is appended to the current end of the file. 6. Performance. The NFS version 2 protocol provides a fixed set of operations between client and server. While a degree of client caching can significantly reduce the amount of client-server interaction, a level of interaction is required just to maintain cache consistency and there yet remain many examples of high client-server interaction that cannot be reduced by caching. The problem becomes more acute when a client’s set of filesystem operations does not map cleanly into the set of NFS procedures. 1.2 The Network Extensible File System NeFS addresses the problems just described. Although a draft specification for a revised version of the NFS protocol has addressed many of the deficiencies of NFS version 2, it has not made non-Unix implementations easier, not does it provide opportunities for performance improvements. Indeed, the extra complexity introduced by modifications to the NFS protocol makes all implementations more difficult. A revised NFS protocol does not appear to be an attractive alternative to the existing protocol. Although it has features in common with NFS, NeFS is a radical departure from NFS. The NFS protocol is built according to a Remote Procedure Call model (RPC) where filesystem operations are mapped across the network as remote procedure calls. The NeFS protocol abandons this model in favor of an interpretive model in which the filesystem operations become operators in an interpreted language. Clients send their requests to the server as programs to be interpreted. Execution of the request by the server’s interpreter results in the filesystem operations being invoked and results returned to the client. Using the interpretive model, filesystem operations can be defined more simply. Clients can build arbitrarily complex requests from these simple operations.
- batoure 11y agoMy first experience with this joke was: https://xkcd.com/1171/ https://xkcd.com/1171/ >If you're having perl problems I feel bad for you son, I had 99 problems then I used regular expressions and now I have 100
- raldi 11y agoTLDR: Everyone always attributes it to JWZ, but it was actually coined by David Tilbrook. It's not mentioned in the blog post, but David told me in 2007 that he said it at a EurOpen conference in Dublin circa 1985. David also told me this is only his second favorite quote; the one he was most proud of, from 1981, was: "Software is the only business in which adding extra lanes to the Golden Gate bridge would be called maintenance."
- WaltPurvis 11y agoIt's included here (along with some other gems): http://install.lon-capa.org/bugzilla/quips.cgi?action=show http://install.lon-capa.org/bugzilla/quips.cgi?action=show
- protomyth 11y agoSo, I guess I'm a monster raving loon[1]. Oh, well, I like Forth too, but always found Postscript to be easier to read and program. 1) http://regex.info/blog/2006-09-15/247#comment-3085 http://regex.info/blog/2006-09-15/247#comment-3085
- moron4hire 11y agoI really don't get the hate for regexps. They aren't very hard to learn and they are hugely productive. I use regexp in my text editor search constantly. It bothers me that I don't have regexp enabled search on everything. Web browser, I'm looking at you! And regexp-based search-and-replace! Swoon! Regexp has made me significantly more productive and less error prone. I haven't made copy-pasta data errors in quite a long time because of it. Yes, particularly hairy regexp looks like line noise. What poorly written code doesn't? I think people get caught up in the idea that they have to try to write one regexp to rule them all and perpetuate until the end of time. Sure, yeah, if you don't understand how to write regexp and have to look up a cheatsheet all the time, I can see how you would want to avoid touching it ever again. But that applies to SQL or CSS or whatever braindead config file format we're using on our project today, or any other language that isn't your wheelhouse. Seriously, learn regexp already.
- aidenn0 11y agoThe hate is when they are used for code where a parser would be better. (e.g. parse an e-mail address). I don't think anybody has an issue with regex search in an editor, but we are more talking about regex as a core language feature. Even in an IDE there are times that regex is the wrong solution. e.g. regex based refactoring can introduce bugs in most languages where a parser based refactoring wouldn't.
- moron4hire 11y agoSounds like throwing the baby out with the bathwater.
- aidenn0 11y agoCan you please let me know what the "baby" is in this case? Nobody is seriously against regexes for all cases (all developer editors have a regex search, for example). However, they aren't even always the clearest way to parse regular languages (depending on the language, automata can be more clear than regexes or vice versa). Perl regexes can parse many context free languages, but again it's not always the clearest way to represent it. Despite the original quote, I use awk as a standard part of my toolbox. I'm not going to write a web-browser in it though. Nearly every time someone says "now you have 2 problems" or "considered harmful" it's a reaction to overuse or misuse, not a literal call to abandon it altogether.
- vldr 11y agoMy favorite variation: Some people, when confronted with a problem, think "I know, I'll use multithreading". Nothhw tpe yawrve o oblems.