archived stringclasses 2
values | author stringlengths 3 20 | author_fullname stringlengths 4 12 ⌀ | body stringlengths 0 22.5k | comment_type stringclasses 1
value | controversiality stringclasses 2
values | created_utc stringlengths 10 10 | edited stringlengths 4 12 | gilded stringclasses 7
values | id stringlengths 1 7 | link_id stringlengths 7 10 | locked stringclasses 2
values | name stringlengths 4 10 ⌀ | parent_id stringlengths 5 10 | permalink stringlengths 41 91 ⌀ | retrieved_on stringlengths 10 10 ⌀ | score stringlengths 1 4 | subreddit_id stringclasses 1
value | subreddit_name_prefixed stringclasses 1
value | subreddit_type stringclasses 1
value | total_awards_received stringclasses 19
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
True | Kireas | null | It's a shame it's only read-only at the moment, but at least we'll start to see some alternative applications crop up for Android, iOS and so on. Maybe things like Tweetdeck too. | null | 0 | 1316115700 | False | 0 | c2k4tv5 | t3_kgsnl | null | t1_c2k4tv5 | t3_kgsnl | null | 1427604693 | 2 | t5_2fwo | null | null | null |
True | Mac-O-War | null | Even reflective languages allow for code generation (or dynamic compilation) at runtime. It would be fairly trivial to bypass an automated tool. | null | 0 | 1316115703 | True | 0 | c2k4tvo | t3_kgl4f | null | t1_c2k4tvo | t1_c2k4s0k | null | 1427604693 | 3 | t5_2fwo | null | null | null |
True | [deleted] | null | Can somebody answer a potentially stupid question from someone who doesn't know a lot about this stuff but considers it interesting?
I've usually seen the travelling salesman problem framed differently - that it's not (as suggested in the example at the link) about simply finding a solution which is under a predetermined distance, but rather about finding the shortest possible solution.
With that framing, how is it possible to verify the solution in polynomial time? How do you know that you have found the optimum solution without first comparing it to all other possible solutions? | null | 0 | 1316115796 | False | 0 | c2k4uci | t3_kgfhb | null | t1_c2k4uci | t3_kgfhb | null | 1427604700 | 8 | t5_2fwo | null | null | null |
True | doomchild | null | It's certainly more readable than Haskell, although that might just be me. | null | 0 | 1316115843 | False | 0 | c2k4ul9 | t3_kgt9u | null | t1_c2k4ul9 | t1_c2k4pa1 | null | 1427604703 | 0 | t5_2fwo | null | null | null |
True | onionhammer | null | It *will* ship with IE 10, that's what the developer preview tablet is running | null | 0 | 1316115889 | False | 0 | c2k4uu5 | t3_kgb4h | null | t1_c2k4uu5 | t1_c2k3c9h | null | 1427604706 | 3 | t5_2fwo | null | null | null |
True | duplico | null | >Many NP complete problems are easy to solve in most cases, for example a random SAT instance is almost always easy to solve.
On a related note, [one of the first asymmetric cryptosystems](http://en.wikipedia.org/wiki/Merkle-Hellman_knapsack_cryptosystem) (since broken) was based on the principle of converting an easy sum-of-subsets problem (set with superincreasing members) to a hard one. | null | 0 | 1316115924 | False | 0 | c2k4v17 | t3_kgfhb | null | t1_c2k4v17 | t1_c2k33jg | null | 1427604708 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | Really really. I've tried Firefox, Dolphin and Google's built-in browser. Opera was my fave so far.. | null | 0 | 1316115932 | False | 0 | c2k4v2h | t3_kgb4h | null | t1_c2k4v2h | t1_c2k2r9e | null | 1427604709 | 3 | t5_2fwo | null | null | null |
True | brainded | null | How are you coming up with half? Show me a stat. This only affects silverlight in tablet mode on Windows 8. I know silverlight was made for the web as a flash competitor but it has a different footing now with WP7 apps. In context of the web, you are correct but that isn't the only place it is used. It isn't dead, its just maturing/finding its place in the world. | null | 0 | 1316115951 | False | 0 | c2k4v6f | t3_kgb4h | null | t1_c2k4v6f | t1_c2k4pgx | null | 1427604710 | 1 | t5_2fwo | null | null | null |
True | otakucode | null | The issue is bigger than this.
A set of ideas that is only very rarely ever even pointed out as being a thing underlies pretty much the entirety of what we do nowadays. The idea of systems. Children learn a great deal about systems - how to explore them, how to find their limits, how to maximize for certain outcomes given a certain set of rules with certain resources, etc from videogames.
It is important that we teach this type of systematic thinking intentionally and not just let exploration of videogame worlds determine how much of it they understand. One very dangerous idea that many people have come to accept is that systems can be perfect. That if you come up with the correct rules for a system and apply them consistently enough, you can guarantee a certain result. This factors in to how people think about government, legal systems, policy in schools and everything else. And the idea that a perfect system can be found, or that systems have inherent value in themselves by virtue of the order they bring, etc is very dangerous. The real world is very complicated, and everything affects everything else. You cannot simply define a system where 'everyone MUST pay their debts' without having that have significant impacts to the rest of society. It may be an idea that works fine in principles in the context of a system where every participant in the system has perfect knowledge of the system, and where the future of the system is predictable, etc. But in reality, the future is not predictable. Human behavior cannot be contained by any system, even if it could have an infinite number of rules. And the systems themselves have no value whatsoever. They are useful in as far as they help toward a goal, but if they do not help, then they are doing harm and there is no excuse to keep sets of rules around simply for their own sake.
All of this goes unsaid now. Everyone just assumes that since they have gone through tons of different situations, figured out the rules the system abides by, and optimized things to get a certain result, that reality actually works that way, or that it can be made to work that way.
It is just as important for a system designer to understand that there will be cases which their system cannot account for, and provide for the ability to circumvent the system, as it is for them to be able to figure out the pertinent factors involved in getting to a certain goal. Coding is simply a means of defining a system exactly, and putting together the systems of rules. Once people understand the whole concept of systems and the general principles that they usually abide by, learning the syntax of a language to implement them isn't too difficult. | null | 0 | 1316116001 | False | 0 | c2k4vgl | t3_kgbzq | null | t1_c2k4vgl | t3_kgbzq | null | 1427604714 | 3 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316116003 | True | 0 | c2k4vh5 | t3_kgfhb | null | t1_c2k4vh5 | t3_kgfhb | null | 1427604714 | 1 | t5_2fwo | null | null | null |
True | Ashex | null | If this is something I can do part-time send me a pm, editing is something I do in my spare time. | null | 0 | 1316116005 | False | 0 | c2k4vho | t3_kgb4h | null | t1_c2k4vho | t1_c2k2zwo | null | 1427604714 | 4 | t5_2fwo | null | null | null |
True | TheRealFender | null | So figuring out if P = NP is an NP problem? | null | 0 | 1316116112 | False | 0 | c2k4w32 | t3_kgfhb | null | t1_c2k4w32 | t1_c2k2npa | null | 1428193985 | 6 | t5_2fwo | null | null | null |
True | onionhammer | null | You understand that WinRT is only for Metro style (touch-first) apps, right? You don't have to use it for windows 8 applications, you *can* use it if you want to write Metro apps. | null | 0 | 1316116124 | False | 0 | c2k4w4z | t3_kgq0v | null | t1_c2k4w4z | t3_kgq0v | null | 1427604724 | 1 | t5_2fwo | null | null | null |
True | bad-tempered | null | No, he's even better then that.
The subtle detail (that I almost also missed) is that his device figures out the source device's encryption key and uses it to encrypt it's own video. That encrypted video is slipped in over the source video, and your TV never knows the difference.
Everything just comes in with the same encryption key. | null | 0 | 1316116193 | False | 0 | c2k4wia | t3_kfby2 | null | t1_c2k4wia | t1_c2jxs8d | null | 1427604729 | 1 | t5_2fwo | null | null | null |
True | lamine_ba | null | robinwholikesjava, Thank you very much for this nice feedback. Very nice name by the way. Yes this blog post is for a very specific audience and I'm glad to have you inside. | null | 0 | 1316116222 | False | 0 | c2k4wno | t3_kfu2n | null | t1_c2k4wno | t1_c2k40mp | null | 1427604732 | 3 | t5_2fwo | null | null | null |
True | newbill123 | null | The 3d editor had better be fantastic!
The demand for a basic 3d editor (no matter how simple and easy to use) will be gone. Students and first timers will stick with the built-in one. Being built-in (whether good or not) it *will* reduce the user base of third party developed 3d editors. Third party developers will now be focusing on niche features or very advanced features.
If the VB 3d editor is fantastic, no one will be motivated to seek a 3rd party tool. If it's bad, students and developers new to 3d will likely blame themselves because they are new rather than the tool. (e.g. "Let me try again with the tool I have. If I suck at 3d modeling I don't want to throw money away on something I'm not good at.").
As a cheapskate I love the idea of paying for fewer tools. But I am not sure I see the advantage for direct VB integration, and I definitely see some downsides for the developers of the alternatives. | null | 0 | 1316116226 | False | 0 | c2k4woi | t3_kg44k | null | t1_c2k4woi | t3_kg44k | null | 1427604733 | 0 | t5_2fwo | null | null | null |
True | [deleted] | null | Idiots. | null | 0 | 1316116307 | False | 0 | c2k4x2n | t3_kghid | null | t1_c2k4x2n | t3_kghid | null | 1427604736 | 5 | t5_2fwo | null | null | null |
True | bad-tempered | null | Or, if each pixel is encrypted the same, and he can encrypt his pixels that way too.
That's what is so amazing about this. He can sit in the middle and figure out the source's encryption key without having to bother with the decryption key. | null | 0 | 1316116359 | False | 0 | c2k4xbs | t3_kfby2 | null | t1_c2k4xbs | t1_c2k1rug | null | 1427604739 | 1 | t5_2fwo | null | null | null |
True | bad-tempered | null | Round corners are easy, just make the chroma mask have round corners. But you're right no about semi-transparent overlay. | null | 0 | 1316116428 | False | 0 | c2k4xnr | t3_kfby2 | null | t1_c2k4xnr | t1_c2k0p5e | null | 1427604742 | 1 | t5_2fwo | null | null | null |
True | ThatsALogicalFallacy | null | Nope. Either it's uncomputable, or there's a constant time solution.
If there is a proof for P = NP or P != NP, then there's a Turing machine which can print out that proof in constant time. If there isn't, then there's no Turing machine which can prove P ?= NP. | null | 0 | 1316116520 | False | 0 | c2k4y4w | t3_kgfhb | null | t1_c2k4y4w | t1_c2k4w32 | null | 1427604750 | 23 | t5_2fwo | null | null | null |
True | riffito | null | Even not being a Star Wars fan... I cannot help but feel that The Force lost him to the Dark Side. | null | 0 | 1316116531 | False | 0 | c2k4y6w | t3_kgl4f | null | t1_c2k4y6w | t3_kgl4f | null | 1427604750 | -1 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316116570 | False | 0 | c2k4yek | t3_kgfhb | null | t1_c2k4yek | t1_c2k4w32 | null | 1427604753 | -5 | t5_2fwo | null | null | null |
True | Apocrypha | null | Uhoh, now there will be 100 apps that all do the same thing... | null | 0 | 1316116597 | False | 0 | c2k4yiz | t3_kgsnl | null | t1_c2k4yiz | t3_kgsnl | null | 1427604765 | 11 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316116600 | False | 0 | c2k4yjj | t3_kejwo | null | t1_c2k4yjj | t1_c2jysvq | null | 1427604765 | 1 | t5_2fwo | null | null | null |
True | AngryDelphiDev | null | Money helps but take a page from the book of George Carlin:
>Now, speaking of parents and speaking of bullshit, two ideas that >aren't always mutually exclusive, by the way, I'd like to mention a >special kind of bullshit that has taken hold in this country in the last >thirty to forty years. It's a form of bullshit that really can only be >called "child worship". It's child worship. It's this excessive devotion to >children.
Basically speaking, if you don't have the option to fail someone, they have no incentive to learn. Public schools don't only suffer from a lack of funding, but a lack of standards. The two are completely intertwined in the great scope. Charter-schools have the same problems. Its all about class size and compensation. I'd be happy to pay higher taxes and have citizens capable of reading and coherent thought. | null | 0 | 1316116612 | False | 0 | c2k4ylv | t3_kgbzq | null | t1_c2k4ylv | t1_c2k4dhj | null | 1427604756 | 2 | t5_2fwo | null | null | null |
True | emarkd | null | So... symmetric very good. Got it. | null | 0 | 1316116622 | False | 0 | c2k4ynz | t3_kgfhb | null | t1_c2k4ynz | t1_c2k4sk4 | null | 1427604756 | 10 | t5_2fwo | null | null | null |
True | vivacity | null | You people who are downvoting him: Go and read the [reddiquette](http://www.reddit.com/help/reddiquette).
> The down arrow is for comments that add nothing to the discussion | null | 0 | 1316116734 | False | 0 | c2k4z61 | t3_kgbzq | null | t1_c2k4z61 | t1_c2k18bv | null | 1427604773 | 2 | t5_2fwo | null | null | null |
True | MarderFahrer | null | I think it's sensible to restrict quota. And to only allow read-only access to public data. Given that this service is in full effect and has a massive userbase that post nothing but public posts. All this combined with the fact that the company that launched this service is a brand new startup without much infrastructure, I say it's totally resonable to implement an API just like that.
I mean, it's gotta be, right? All the other calls they made regarding this service were homeruns, right? Say, do you still need an invite even after the initial *buzz* is long gone? | null | 0 | 1316116782 | False | 0 | c2k4zdu | t3_kgsqo | null | t1_c2k4zdu | t3_kgsqo | null | 1427604766 | 0 | t5_2fwo | null | null | null |
True | onionhammer | null | >You can't have a one-size-fits-all interface when your target devices are so drastically different.
That's probably precisely the reason Metro exists... Hopefully if no touch-device is connected, microsoft will adapt a more 'traditional' approach | null | 0 | 1316116838 | False | 0 | c2k4znk | t3_kejwo | null | t1_c2k4znk | t1_c2jrjya | null | 1427604769 | 1 | t5_2fwo | null | null | null |
True | cosmo7 | null | I think *you* might have screwed up; which part makes you think it isn't C++?
| null | 0 | 1316116915 | False | 0 | c2k4zzi | t3_kgq0v | null | t1_c2k4zzi | t3_kgq0v | null | 1427604775 | 2 | t5_2fwo | null | null | null |
True | duplico | null | Yup. Though, in practice if we have no secure way to exchange keys we may be screwed no matter how practically unbreakable they are. | null | 0 | 1316116944 | False | 0 | c2k5046 | t3_kgfhb | null | t1_c2k5046 | t1_c2k4ynz | null | 1427604781 | 11 | t5_2fwo | null | null | null |
True | Saivo | null | TL;DR: Java
*/ducks and covers* | null | 0 | 1316117068 | False | 0 | c2k50qu | t3_kgq62 | null | t1_c2k50qu | t3_kgq62 | null | 1427604786 | -12 | t5_2fwo | null | null | null |
True | Zach_the_Lizard | null | Tablets now let you use Bluetooth keyboards to type on. | null | 0 | 1316117089 | False | 0 | c2k50uu | t3_kgb4h | null | t1_c2k50uu | t1_c2k1kms | null | 1427604797 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | haha you're welcome bro | null | 0 | 1316117262 | False | 0 | c2k51qb | t3_kgteo | null | t1_c2k51qb | t1_c2k4q7g | null | 1427604799 | -2 | t5_2fwo | null | null | null |
True | trezor2 | null | The F# runtime should be able run a subset of OCaml code unmodified. The same goes back: A subset of F# ports perfectly fine to OCaml.
That said, there are powerful portions of OCaml which are not available in F# and vice versa. So to answer OP, I would definitely say it's closer to OCaml/ML than Haskell yes. | null | 0 | 1316117268 | True | 0 | c2k51rp | t3_kgt9u | null | t1_c2k51rp | t1_c2k4teq | null | 1427604800 | 3 | t5_2fwo | null | null | null |
True | frezik | null | Great, now some doorknob will implement a ProxyPattern just because they want an Achievement. | null | 0 | 1316117345 | False | 0 | c2k523x | t3_kgdeg | null | t1_c2k523x | t3_kgdeg | null | 1427604802 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316117352 | False | 0 | c2k524z | t3_kgfhb | null | t1_c2k524z | t3_kgfhb | null | 1427604802 | 1 | t5_2fwo | null | null | null |
True | trezor2 | null | Good to see Windows 8 is Windows-compliant and has a BSOD.
And I mean that in the most friendly way imagineable ;) | null | 0 | 1316117441 | False | 0 | c2k52kz | t3_kgteo | null | t1_c2k52kz | t3_kgteo | null | 1427604807 | 2 | t5_2fwo | null | null | null |
True | [deleted] | null | Agreed, anyone that has to deal with that sort of thing on a regular basis will be grateful for the tool.
Also, it looks like in embedding PIX into VS2011 they've really cleaned up the layout a lot and present a lot of the common information in a much more easily read layout.
Personally I like the changes but they are highly relevant to the work I do in VS. | null | 0 | 1316117498 | False | 0 | c2k52vt | t3_kg44k | null | t1_c2k52vt | t1_c2k0xhp | null | 1427604811 | 3 | t5_2fwo | null | null | null |
True | PericlesATX | null | You don't know that. Maybe it is. | null | 0 | 1316117559 | False | 0 | c2k5368 | t3_kgb4h | null | t1_c2k5368 | t1_c2k3ipr | null | 1427604815 | 2 | t5_2fwo | null | null | null |
True | nemtrif | null | The extensions are really optional. It would be interesting to come up with a library that would hide most of the WinRT COM verbosity with standard C++ syntax.
And I don't mean ATL. | null | 0 | 1316117561 | False | 0 | c2k536m | t3_kgs75 | null | t1_c2k536m | t3_kgs75 | null | 1427604815 | 3 | t5_2fwo | null | null | null |
True | giggsey | null | Is is just me, or is the whole http://developers.google.com/ new too? | null | 0 | 1316117635 | False | 0 | c2k53j7 | t3_kgsnl | null | t1_c2k53j7 | t3_kgsnl | null | 1427604823 | 5 | t5_2fwo | null | null | null |
True | [deleted] | null | I'd say that F# is _very_ close to OCaml.
The lovechild of C# (or Java) and Haskell is Scala. | null | 0 | 1316117665 | False | 0 | c2k53ob | t3_kgt9u | null | t1_c2k53ob | t3_kgt9u | null | 1427604821 | 3 | t5_2fwo | null | null | null |
True | joseph177 | null | Doesn't a quantum computer literally solve every possibility at once? | null | 0 | 1316117787 | False | 0 | c2k549s | t3_kgfhb | null | t1_c2k549s | t3_kgfhb | null | 1427604830 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | Nice. I realize you are just making a static site here, but it might be a good idea to save the Json data in localstorage and have your app pull it out as needed. This way you can update data in the background when the user is online without downloading the whole manifest whenever the data changes. Otherwise you typically need to change the name of the manifest to get browsers to refresh the cache. The combination of these two storage methods can be very powerful. | null | 0 | 1316117798 | False | 0 | c2k54bp | t3_kgjcg | null | t1_c2k54bp | t1_c2k49o6 | null | 1427604831 | 2 | t5_2fwo | null | null | null |
True | [deleted] | null | Oh god ... `var name: type` please! :-D | null | 0 | 1316117887 | False | 0 | c2k54qi | t3_kfvm7 | null | t1_c2k54qi | t1_c2k461l | null | 1427604836 | 3 | t5_2fwo | null | null | null |
True | grauenwolf | null | The two halves are not likely to be an event 50/50 split. | null | 0 | 1316117925 | False | 0 | c2k54xm | t3_kgb4h | null | t1_c2k54xm | t1_c2k4v6f | null | 1427604839 | -1 | t5_2fwo | null | null | null |
True | p337 | null | I have seen it the way you describe as well, and I think that might be why they re-framed like that. It is not possible to simply check if a TSP solution is optimal. The way I heard this problem, it was more about using heuristic algorithms to find better and better solutions. This is the same problem, but any "solution" can be easily checked by using the mileage.
Maybe that is the difference between "NP-Hard" and "NP-complete." (someone more knowledgeable than me may know if that is true) | null | 0 | 1316117932 | True | 0 | c2k54yo | t3_kgfhb | null | t1_c2k54yo | t1_c2k4uci | null | 1427604839 | 1 | t5_2fwo | null | null | null |
True | usefulcat | null | It's C++/CLI, which is not the same as standard C++. | null | 0 | 1316117940 | False | 0 | c2k5504 | t3_kgq0v | null | t1_c2k5504 | t1_c2k4zzi | null | 1427604840 | 0 | t5_2fwo | null | null | null |
True | frezik | null | Good. Letting other stakeholders in just leads to design-by-committee. There's already a language like that, and it's called ECMAScript, and I'd like an alternative. | null | 0 | 1316117974 | False | 0 | c2k556d | t3_kfyc7 | null | t1_c2k556d | t1_c2jytiq | null | 1427604842 | 4 | t5_2fwo | null | null | null |
True | grauenwolf | null | Again it was a simplifed example. If you need to assign multiple values depending on y that won't necessarily work. | null | 0 | 1316117985 | False | 0 | c2k5586 | t3_kfvm7 | null | t1_c2k5586 | t1_c2k3lu9 | null | 1427604842 | 1 | t5_2fwo | null | null | null |
True | thenamedone1 | null | From who/what? The general consensus seems to be that Java is worthless.
/newb programmer
edit: Since this is getting a bit of negative attention, I should probably clarify that the few programmers I know irl reeeeally have a strong dislike of java. I don't really give a shit either way, I'm just trying to learn as much as possible. | null | 0 | 1316118090 | True | 0 | c2k55rf | t3_kgq62 | null | t1_c2k55rf | t1_c2k50qu | null | 1427604849 | -12 | t5_2fwo | null | null | null |
True | Fabien4 | null | Easier: Download DigiNotar's root key, and use it to sign your certificate. | null | 0 | 1316118111 | False | 0 | c2k55vn | t3_kgqxt | null | t1_c2k55vn | t3_kgqxt | null | 1427604851 | 16 | t5_2fwo | null | null | null |
True | mlk | null | N = 1
Where is my million dollar? | null | 0 | 1316118133 | False | 0 | c2k560d | t3_kgfhb | null | t1_c2k560d | t1_c2k340q | null | 1427604853 | 12 | t5_2fwo | null | null | null |
True | wodahSShadow | null | Let me check, be right back. | null | 0 | 1316118209 | False | 0 | c2k56d9 | t3_kgfhb | null | t1_c2k56d9 | t1_c2k44hq | null | 1427604862 | 18 | t5_2fwo | null | null | null |
True | p337 | null | Once you can solve that "kind" of problem in a fast way, it allows you to solve all the other problems like that. They are just supposed to be easy to visualize problems.
Another NP-complete problem is graph-coloring. Again, it seems like something pretty inane, but there are many [applications](http://en.wikipedia.org/wiki/Graph_coloring_problem#Applications) of it.
Here are some more [applications](http://en.wikipedia.org/wiki/Knapsack_problem#Applications) for problems related to the tower stacking example. | null | 0 | 1316118235 | False | 0 | c2k56h5 | t3_kgfhb | null | t1_c2k56h5 | t1_c2k4laz | null | 1427604858 | 2 | t5_2fwo | null | null | null |
True | learnyouahaskell | null | Well, [have a look around](http://www.google.com/search?rlz=1C1CHNY_enUS405US405&sourceid=chrome&ie=UTF-8&q=windows+3.1+theme+for+xp). Apparently there's a registry key you can change to use Progman for the shell (or use msconfig and change the `shell=` value). I think I've used it before but I couldn't do much with it. | null | 0 | 1316118262 | False | 0 | c2k56kg | t3_kejwo | null | t1_c2k56kg | t1_c2ju0p8 | null | 1427604860 | 1 | t5_2fwo | null | null | null |
True | Anathem | null | Are you joking? | null | 0 | 1316118267 | False | 0 | c2k56mb | t3_kg44k | null | t1_c2k56mb | t1_c2k2ubl | null | 1427604861 | 3 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316118303 | False | 0 | c2k56te | t3_kgfhb | null | t1_c2k56te | t3_kgfhb | null | 1427604862 | 1 | t5_2fwo | null | null | null |
True | dimmu_burger | null | Indeed. The first line:
>Informally, it asks whether every problem whose solution can be efficiently checked by a computer can also be efficiently solved by a computer.
explained it better [to me] than the entire simple.wiki page. It is a great synopsis and makes following the rest of it much easier. Perhaps someone should add it in. | null | 0 | 1316118330 | False | 0 | c2k56y3 | t3_kgfhb | null | t1_c2k56y3 | t1_c2k4ikk | null | 1427604864 | 2 | t5_2fwo | null | null | null |
True | KyteM | null | I think the .NET codegen assemblies are also forbidden from Metro-style apps, along with arbitrary storage and external code execution. That makes it pretty hard unless you're writing a whole compiler. | null | 0 | 1316118339 | False | 0 | c2k56zn | t3_kgl4f | null | t1_c2k56zn | t1_c2k4tvo | null | 1427604864 | 5 | t5_2fwo | null | null | null |
True | johntb86 | null | Actually, it is a stream cipher, so even without the encryption key you could maybe do fun bit-flipping attacks to modify what's on the screen. | null | 0 | 1316118351 | False | 0 | c2k5724 | t3_kfby2 | null | t1_c2k5724 | t1_c2jyrci | null | 1427604866 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | A [One-time pad](http://en.wikipedia.org/wiki/One_time_pad) will always be safe. And I think most symmetric encryption algorithms are also safe under the assumption that P=NP, because Brute-force algorithms are in EXP which is disjunct from P. | null | 0 | 1316118371 | True | 0 | c2k575l | t3_kgfhb | null | t1_c2k575l | t1_c2k2yk3 | null | 1427604866 | 12 | t5_2fwo | null | null | null |
True | dmitry_sychov | null | i thought F# = Ocaml. No? | null | 0 | 1316118391 | False | 0 | c2k579f | t3_kgt9u | null | t1_c2k579f | t3_kgt9u | null | 1427604868 | 3 | t5_2fwo | null | null | null |
True | jollyllama | null | My favorite quote I've heard in a while about tech is that for the last 20 years, consumers have been wanting an elevator, and the tech industry has been selling them an airplane. Full PCs have just been to complicated, easy to mess up, and overpowered for what the average user really wants a computer for. The iPad comes as close to an elevator in this analogy as any product on the market. Most people have never used their PCs for more than 5% of it's capabilities. | null | 0 | 1316118406 | False | 0 | c2k57bu | t3_kgb4h | null | t1_c2k57bu | t1_c2k2rl1 | null | 1427604869 | 1 | t5_2fwo | null | null | null |
True | the_red_scimitar | null | Oh yeah, I remember Google+. Or was that Buzz? | null | 0 | 1316118454 | False | 0 | c2k57l2 | t3_kgsnl | null | t1_c2k57l2 | t3_kgsnl | null | 1427604872 | 57 | t5_2fwo | null | null | null |
True | JeepTheBeep | null | Exactly, so symmetric can never be very good on its own. | null | 0 | 1316118508 | False | 0 | c2k57v0 | t3_kgfhb | null | t1_c2k57v0 | t1_c2k5046 | null | 1427604877 | 7 | t5_2fwo | null | null | null |
True | timbatron | null | I think you are underestimating Microsoft engineers. You realize they've already done exactly what you're talking about on XBox 360 and Windows Phone 7, right? | null | 0 | 1316118544 | False | 0 | c2k581l | t3_kgl4f | null | t1_c2k581l | t1_c2k4b1f | null | 1427604879 | 7 | t5_2fwo | null | null | null |
True | Smok3dSalmon | null | NOW I CAN CONNECT MY APPLICATIONS TO MILLIONS OF GUYS! | null | 0 | 1316118552 | False | 0 | c2k5833 | t3_kgsnl | null | t1_c2k5833 | t3_kgsnl | null | 1427604879 | 57 | t5_2fwo | null | null | null |
True | Jookia | null | Wow, that looks great. It's needed an overhaul for a whil-
> and it happens that this implementation is based on top of COM.
Oh. | null | 0 | 1316118579 | False | 0 | c2k588i | t3_kgl4f | null | t1_c2k588i | t3_kgl4f | null | 1427604881 | 8 | t5_2fwo | null | null | null |
True | [deleted] | null | Nice work, btw this runs fantastic in IE10 | null | 0 | 1316118610 | False | 0 | c2k58dd | t3_kgjcg | null | t1_c2k58dd | t3_kgjcg | null | 1427604883 | 1 | t5_2fwo | null | null | null |
True | unquietwiki | null | If you want to repost this with your title, I'll delete my post. I've tried using Haskell; not OCaml. | null | 0 | 1316118619 | False | 0 | c2k58fc | t3_kgt9u | null | t1_c2k58fc | t1_c2k53ob | null | 1427604884 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316118628 | False | 0 | c2k58hg | t3_kgfhb | null | t1_c2k58hg | t1_c2k2ihl | null | 1427604886 | 10 | t5_2fwo | null | null | null |
True | Saivo | null | I'm sure Reddit has its share of apologists. | null | 0 | 1316118678 | False | 0 | c2k58q7 | t3_kgq62 | null | t1_c2k58q7 | t1_c2k55rf | null | 1427604890 | 0 | t5_2fwo | null | null | null |
True | cowhead | null | I'd solve that problem with a hammer (and a scale). I bet I can do it in polynomial time too! | null | 0 | 1316118686 | False | 0 | c2k58rp | t3_kgfhb | null | t1_c2k58rp | t1_c2k44hq | null | 1427604890 | 3 | t5_2fwo | null | null | null |
True | Jookia | null | Windows 8's WinRT API uses COM. | null | 0 | 1316118702 | False | 0 | c2k58uo | t3_kgb4h | null | t1_c2k58uo | t1_c2k27oo | null | 1427604889 | 1 | t5_2fwo | null | null | null |
True | chuliomartinez | null | Quicksort can be made O(nlog). It all depends on how you pick the pivot. The naive way, will make qsort nlog on the average, however picking the median will make it O(nlog).
http://en.wikipedia.org/wiki/Quicksort#Selection-based_pivoting | null | 0 | 1316118710 | False | 0 | c2k58wd | t3_kgfhb | null | t1_c2k58wd | t1_c2k4904 | null | 1427604891 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | he must be... | null | 0 | 1316118726 | False | 0 | c2k58ze | t3_kg44k | null | t1_c2k58ze | t1_c2k56mb | null | 1427604891 | 2 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316118732 | False | 0 | c2k590h | t3_kgfhb | null | t1_c2k590h | t1_c2k219a | null | 1427604893 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316118767 | False | 0 | c2k5972 | t3_kghid | null | t1_c2k5972 | t3_kghid | null | 1427604895 | 1 | t5_2fwo | null | null | null |
True | anshou | null | > Why does anyone think that P might equal NP?
Because there is no proof that it does not, and so the possibility exists. Some people want P=NP and some probably want P≠NP. Proving either has a lot of far-reaching implications in numerous fields. | null | 0 | 1316118812 | False | 0 | c2k59fq | t3_kgfhb | null | t1_c2k59fq | t1_c2k2ihl | null | 1427604897 | 3 | t5_2fwo | null | null | null |
True | ThePiousInfant | null | Great overview, though saying "P problems are 'easy' for computers to solve" is a bit misleading. There are plenty of P problems for which tractable solutions do not (yet) exist. | null | 0 | 1316118812 | False | 0 | c2k59fu | t3_kgfhb | null | t1_c2k59fu | t3_kgfhb | null | 1427604897 | 2 | t5_2fwo | null | null | null |
True | gmfawcett | null | Understood, but concurrency is a notoriously hard thing to tack onto a language after it's been fleshed out. | null | 0 | 1316118819 | False | 0 | c2k59hb | t3_kfvm7 | null | t1_c2k59hb | t1_c2k4gjc | null | 1427604898 | 1 | t5_2fwo | null | null | null |
True | Cacafuego | null | If
> P problems are considered "easy" for computers to solve
And
> NP problems are considered hard for a computer to solve
Then how can it be that
> All P problems are NP problems
?
| null | 0 | 1316118830 | False | 0 | c2k59jj | t3_kgfhb | null | t1_c2k59jj | t3_kgfhb | null | 1427604898 | 1 | t5_2fwo | null | null | null |
True | henk53 | null | In "my" time, computers were actually more inviting to get kids into programming.
Besides games, there wasn't a lot you could do with say a commodore 64 out of the box. There wasn't any public Internet, so when you got bored with games quite some kids actually tried some programming.
The fact that many of those early computers booted straight into a BASIC interpreter really helped with that. Who didn't try *10 hello 20 goto 10* at the time? | null | 0 | 1316118891 | False | 0 | c2k59un | t3_kgbzq | null | t1_c2k59un | t3_kgbzq | null | 1427604902 | 4 | t5_2fwo | null | null | null |
True | [deleted] | null | Its huge in Russia. | null | 0 | 1316118894 | False | 0 | c2k59vb | t3_kgbzq | null | t1_c2k59vb | t1_c2k1lgx | null | 1427604907 | 3 | t5_2fwo | null | null | null |
True | [deleted] | null | Intranet application works in Firefox 8, but doesn't in Firefox 9. | null | 0 | 1316119010 | False | 0 | c2k5agb | t3_kghid | null | t1_c2k5agb | t1_c2k3bii | null | 1427604911 | 6 | t5_2fwo | null | null | null |
True | jonknet | null | When your friends opens a: 5 GB free account, 30GB or larger account
You and your friends will earn: 500MB , 10GB (per referral)
Maximum bonus space you can earn: No Limit.
And like I said, it's fast enough to stream video apparently to droid phones (unlike dropbox). | null | 0 | 1316119016 | False | 0 | c2k5agw | t3_kgvz3 | null | t1_c2k5agw | t3_kgvz3 | null | 1427604911 | 1 | t5_2fwo | null | null | null |
True | sbrown123 | null | It would be nice if the next release targeted fixing this issue. The OptiFine mod went a long way at killing the lag spikes from chunking. The game just does too much in one loop (tick) for its own good. | null | 0 | 1316119088 | False | 0 | c2k5au3 | t3_kgq62 | null | t1_c2k5au3 | t3_kgq62 | null | 1427604916 | 5 | t5_2fwo | null | null | null |
True | alecco | null | I'd rather use Comodo's as they were not removed by all browsers and OSs and can be 0wned by scrippt kiddies with "mad DLL skillz".
* [Comodo Group Breach of Security](http://en.wikipedia.org/wiki/Comodo_Group#Breach_of_security)
* [A talk with more insigths on the issue](http://www.youtube.com/watch?v=Z7Wl2FW2TcA). | null | 0 | 1316119100 | False | 0 | c2k5avu | t3_kgqxt | null | t1_c2k5avu | t1_c2k55vn | null | 1427604917 | 4 | t5_2fwo | null | null | null |
True | masklinn | null | And more stupid (nullable reference types again?) | null | 0 | 1316119124 | False | 0 | c2k5b0b | t3_kfvm7 | null | t1_c2k5b0b | t1_c2k0tbz | null | 1427604918 | 0 | t5_2fwo | null | null | null |
True | dimmu_burger | null | Can we get a layman's example of verifying a solution without checking all solutions? Is that the rock one? You have 2 piles; check to see if they're equal? So that would mean that the solution is needed, right? e.g. we have to know that we're looking for 2 equal piles, right? If so, where does the 'find all possible solutions' come in?
Also, again with the rocks, if we know we are looking for 2 equal piles, run them down a conveyor weighing each one then dispersing evenly into two piles meanwhile keeping track of the weight of each, then close to the end adjust distribution based on the weights or be able to identify which rocks need to go from one pile to the other? Is this still considered checking all possible solutions because you weighed each rock?
Proof reading this post, it has come to my attention that I'm an idiot. | null | 0 | 1316119154 | False | 0 | c2k5b5r | t3_kgfhb | null | t1_c2k5b5r | t3_kgfhb | null | 1427604919 | 2 | t5_2fwo | null | null | null |
True | sitq | null | I have discovered a truly remarkable proof which this comment field is too small to contain. | null | 0 | 1316119162 | False | 0 | c2k5b77 | t3_kgfhb | null | t1_c2k5b77 | t3_kgfhb | null | 1427604921 | 26 | t5_2fwo | null | null | null |
True | sht | null | I have only begun learning ATS, but the first thing I would do is rename t@ype to something that doesn't have a @ symbol in the middle of it. | null | 0 | 1316119168 | False | 0 | c2k5b8i | t3_kfvm7 | null | t1_c2k5b8i | t1_c2jzc16 | null | 1427604921 | 1 | t5_2fwo | null | null | null |
True | jasonthe | null | Auto-vectorization is HUGE in terms of speed. | null | 0 | 1316119193 | False | 0 | c2k5bcp | t3_kg44k | null | t1_c2k5bcp | t1_c2k1ulc | null | 1427604923 | 1 | t5_2fwo | null | null | null |
True | markild | null | I actually think it's both of you. | null | 0 | 1316119271 | False | 0 | c2k5bs7 | t3_kgsnl | null | t1_c2k5bs7 | t1_c2k53j7 | null | 1427604928 | 11 | t5_2fwo | null | null | null |
True | gmartres | null | Java, if you include type-safety in the definition of strongly-typed:
String[] s = { "foo" };
Object[] o = s;
o[0] = new Object();
This compiles without even a warning, but throws a
java.lang.ArrayStoreException: java.lang.Object
at runtime, see http://sequence.complete.org/node/380
Not to mention you spend a lot of time casting things back and forth in Java. | null | 0 | 1316119315 | False | 0 | c2k5c11 | t3_kfvm7 | null | t1_c2k5c11 | t1_c2k3qjg | null | 1427604931 | 2 | t5_2fwo | null | null | null |
True | jasonthe | null | Ah, it's for managed collections. But yeah, it's just kind of silly that they don't add it because it's so simple. You can at least emulate it with a macro (was more complex in 2008, but in 2010 there's auto so it's not so bad). | null | 0 | 1316119334 | False | 0 | c2k5c4j | t3_kg44k | null | t1_c2k5c4j | t1_c2k1sxi | null | 1427604933 | 1 | t5_2fwo | null | null | null |
True | grauenwolf | null | This is a new COM. It supports classes, not just interfaces, constructors, inheritance, and numerous other things that the .NET and JavaScript developers wanted.
One thing is doesn't have is IDispatch and TLB files. Apparently these suck for performance and the JavaScript guys told the WinRT to "use anything but TLB". That's why the metadata is exposed via the CLR standard.
more info: http://www.infoq.com/news/2011/09/C-Component-Extensions | null | 0 | 1316119341 | True | 0 | c2k5c5q | t3_kgl4f | null | t1_c2k5c5q | t1_c2k588i | null | 1427604933 | 14 | t5_2fwo | null | null | null |
True | HerrKevin | null | This is correct, the optimization version of TSP is NP-Hard as opposed to NP-complete. You cannot verify that it is optimal in polynomial time. You have to solve the entire problem to determine whether or not the answer is correct.
Note that there are decision problems that are also NP-Hard and not NP-complete, it's not just optimization problems. | null | 0 | 1316119436 | False | 0 | c2k5cmt | t3_kgfhb | null | t1_c2k5cmt | t1_c2k54yo | null | 1427604939 | 4 | t5_2fwo | null | null | null |
Subsets and Splits
Filtered Reddit Uplifting News
The query retrieves specific news articles by their link IDs, providing a basic overview of those particular entries without deeper analysis or insights.
Recent Programming Comments
Returns a limited set of programming records from 2020 to 2023, providing basic filtering with minimal analytical value.