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 | [deleted] | null | [deleted] | null | 0 | 1316145240 | False | 0 | c2k8hip | t3_kgfhb | null | t1_c2k8hip | t1_c2k575l | null | 1427606417 | 2 | t5_2fwo | null | null | null |
True | [deleted] | null | I don't know myself. When I first joined, I added some of my co-workers and then later added my name to a reddit "add me" thread. I then got inundated with lots of posts about how great Google+ is/was from the reddit crowd. I even added two celebrities - Will Wheaton and Felicia day.
So this made my stream active, but for me I'm only really concerned with status updates from people I know. I see status updates like "Google+ is awesome because my Mom isn't on here.". But for me and a large number of Facebook people, I use Facebook primarily for communication with family and people I know in person. I tried deleting my reddit circle, but that doesn't help because I'm still in *their* circle and they post every thing to me. In order to stop them, I have to block them one by one (kind of like email spammers).
So for me, Google+ is still useless. Until people I know IRL get on there, it just sits as a bookmark. I hate how the circles work on the stream. I have to click through 5 circles to see if there are any updates in each of them. The alternative is the main stream where everyone is shouting at me. I've sent feedback multiple times for making the circles as checkboxes so I can view the stream from 2 or more circles at a time.
Anyways, my personal discord aside, Google+ would make a good replacement for Twitter. It's a real good way to communicate with people you don't personally know. It doesn't have that SMS capability twitter is known for (AFAIK), but with the Android/iPhone apps, that might not be as important these days. I can definitely see Google+ gaining momentum as people from twitter start checking it out and realizing how many more features it has that Twitter doesn't. If Google+ gets enough people in that way, it might start to pull in more people from Facebook.
/my opinion, not based on any research | null | 0 | 1316145314 | False | 0 | c2k8hud | t3_kgsnl | null | t1_c2k8hud | t1_c2k7zi1 | null | 1427606421 | 13 | t5_2fwo | null | null | null |
True | Lothrazar | null | PLEASE ABANDON INTERNET EXPLORER | null | 0 | 1316145315 | False | 0 | c2k8huj | t3_kgb4h | null | t1_c2k8huj | t3_kgb4h | null | 1427606421 | 1 | t5_2fwo | null | null | null |
True | yogthos | null | well there is [that](http://www.youtube.com/watch?v=ckOpWQYpKjo) :P | null | 0 | 1316145378 | False | 0 | c2k8i3a | t3_kg44k | null | t1_c2k8i3a | t1_c2k0x8b | null | 1427606425 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | You're not embracing the movement away from version numbers.
You should say "Intranet application works in Firefox, but doesn't in Firefox." | null | 0 | 1316145485 | False | 0 | c2k8ije | t3_kghid | null | t1_c2k8ije | t1_c2k5agb | null | 1427606431 | 10 | t5_2fwo | null | null | null |
True | Slime0 | null | > For one, octrees would allow you to not have to spend any cpu time gathering polygons together.
[Edit: sorry about the length. I got overexcited.]
Walking the octree takes CPU time. It also is likely to have worse memory cache performance than walking a linear array of blocks. Now, you may make up that time if the octree prevents you from having to recurse too deep. Indeed, in large open areas with no blocks, or underground in solid areas with many blocks of the same type, the octree may save memory. However, for rendering we're concerned about the surface - the area in between the solid and nonsolid blocks. Considering that the terrain in minecraft is very random, both geometrically and in terms of block types, the occurrences of large 2x2x2 or 4x4x4 blocks of the same type of block, in the right place for the octree to benefit from it, and forming part of the surface, are going to be rare. So in reality, this is likely to take *more* time and still generate almost the same number of triangles. To be fair, you'd have to try it and measure it to be sure.
Now, let's say it worked really well and you rarely had to recurse down to the 1x1 block size. You're going to generate polygons that are 2x2 and 4x4, etc. These polygons are not going to share vertices with the adjacent 1x1 polygons. This creates what's called T-junctions, and they tend to create ugly seams when rendered. You have to do more work to fix these up by adding vertices and splitting up the larger quads.
Another problem is that Minecraft uses one texture for all geometry, which means you can't repeat a single block type's texture without creating separate polygons for each repetition. So if you want to use this strategy to reduce the number of polygons, you're going to have to separate the textures for each block type and render them individually. The problem with this is that switching textures takes a *lot* of time as compared to rendering polygons. It is more beneficial to render the entire world all at once with a single texture. I am assuming (and I may be wrong) that Minecraft takes advantage of this.
In addition, maintaining the octree as blocks change dynamically is likely to be a difficult task that will add complexity to the program, which means more bugs to fix.
All of this is assuming that gathering and/or rendering the polygons is slow enough to be worth optimizing, and the article seems to point to chunk generation as the larger problem.
I don't mean to knock your idea. It's possible that there are some ways to optimize the triangle count. I just don't think an octree is the right approach to this problem. | null | 0 | 1316145491 | True | 0 | c2k8ikf | t3_kgq62 | null | t1_c2k8ikf | t1_c2k7g93 | null | 1427606431 | 19 | t5_2fwo | null | null | null |
True | alecco | null | > **Installing a Certificate in the Trusted Root Certification Authorities Store**
> [...]
> 1. Open the certificate snap-in. For more information, see How to: View Certificates with the MMC Snap-in.
> [...]
[It requires installing an optional pack](http://stackoverflow.com/questions/1434320/active-directory-users-and-computers-mmc-snap-in-for-windows-7):
> For Windows Vista and Windows 7 you need to get the Remote Server Administration Tools (RSAT) - the Active Directory Users & Computers Snap-In is included in that pack. Download link: Remote Server Administration Tools for Windows 7.
I only needed to install one cert to do a very simple website/web service check from a client computer with IE. And you show me .Net documentation on creating certificates. It's not a development computer. | null | 0 | 1316145703 | False | 0 | c2k8jf0 | t3_kgqxt | null | t1_c2k8jf0 | t1_c2k8dd6 | null | 1427606442 | 5 | t5_2fwo | null | null | null |
True | yeswecould | null | The analogy is invalid. Mono can only benefit Microsoft, never harm it. Mono gives .NET credibility as developers today value languages that can be run on multiple platforms and Mono provides that. In mobile phone area they provide even bigger service as with Monodroid and Monotouch they provide something that Java failed - unifying language for three major platforms which will result in increased usage of C# language which will in turn increase the number of WP7 apps. Microsoft should really put Mono guys on payroll. | null | 0 | 1316145859 | False | 0 | c2k8k2o | t3_kgl4f | null | t1_c2k8k2o | t1_c2k7epk | null | 1427606454 | 6 | t5_2fwo | null | null | null |
True | UberMouse894 | null | Did you launch it from the metro style app icon? Mine defaulted to metro style, and I set it to desktop mode but it still launches metro style via that icon. | null | 0 | 1316145892 | False | 0 | c2k8k7i | t3_kgb4h | null | t1_c2k8k7i | t1_c2k7wn5 | null | 1427606456 | 1 | t5_2fwo | null | null | null |
True | sturmeh | null | What do you take me for, a connoisseur of approximately sized rocks? | null | 0 | 1316146098 | False | 0 | c2k8l36 | t3_kgfhb | null | t1_c2k8l36 | t1_c2k7oin | null | 1428193947 | 8 | t5_2fwo | null | null | null |
True | ZorbaTHut | null | I've always found the "undecidable" concept to be a bit odd in this context. If it's undecidable, doesn't that mean we can never find a way to solve a NP problem in P? If there's no way to solve a NP problem in P, doesn't that effectively mean P != NP? | null | 0 | 1316146141 | False | 0 | c2k8l9b | t3_kgfhb | null | t1_c2k8l9b | t1_c2k826m | null | 1427606475 | 3 | t5_2fwo | null | null | null |
True | qrios | null | To remain optimistic about P==NP is to remain pessimistic about the quality of your own algorithms. | null | 0 | 1316146157 | False | 0 | c2k8lba | t3_kgfhb | null | t1_c2k8lba | t1_c2k2lmr | null | 1427606477 | 5 | t5_2fwo | null | null | null |
True | rizla7 | null | huh? run MMC, add snap-in, certificates...
or start -> run -> certmgr.msc
also see if you have any of these errors:
http://msdn.microsoft.com/en-us/library/dd565642%28v=vs.85%29.aspx
http://msdn.microsoft.com/en-us/library/dd565655%28v=vs.85%29.aspx
honestly i havent used self-signed in ie8/ie9 yet, maybe there is a catch, but i think i did in ie7 and there was no problem.
*also, if you had read the linked article: "Installing a Certificate in the Trusted Root Certification Authorities Store"*
but uh yea.. im still not following.. you have an http server running ssl but you don't have a CA? which server? windows? install a CA... | null | 0 | 1316146157 | True | 0 | c2k8lbi | t3_kgqxt | null | t1_c2k8lbi | t1_c2k8jf0 | null | 1427606477 | -8 | t5_2fwo | null | null | null |
True | sturmeh | null | Sorry you must have misunderstood, I'm referring to diamonds. | null | 0 | 1316146253 | False | 0 | c2k8lpx | t3_kgfhb | null | t1_c2k8lpx | t1_c2k58rp | null | 1427606480 | 2 | t5_2fwo | null | null | null |
True | digijin | null | I was at an adobe conference recently and they showcased a flash-to-javascript converter they were working on to gauge interest. They didn't say for sure if/when it would be released tho. | null | 0 | 1316146265 | False | 0 | c2k8lre | t3_kgb4h | null | t1_c2k8lre | t1_c2k0t8p | null | 1427606480 | 1 | t5_2fwo | null | null | null |
True | semarj | null | I think this is summed up pretty well by Joel Spolsky when he talks about UNIX vs Windows culture.
>Unix culture values code which is useful to other programmers, while Windows culture values code which is useful to non-programmers.
(fast forward 8 years, :%s/Windows/Apple/g)
Yes, Apple is anti programmer. Apple is pro user. Apple does not need or want your business.
| null | 0 | 1316146283 | False | 0 | c2k8lu5 | t3_kgqnz | null | t1_c2k8lu5 | t3_kgqnz | null | 1427606482 | 5 | t5_2fwo | null | null | null |
True | sturmeh | null | You're gonna be waiting a while... | null | 0 | 1316146332 | False | 0 | c2k8m1p | t3_kgfhb | null | t1_c2k8m1p | t1_c2k7clg | null | 1427606482 | 3 | t5_2fwo | null | null | null |
True | LetsGetDigital | null | The number of tri's isn't the problem, as its hardly more than a few million tri's/frame, which aren't going through fancy post-processing stuff. The problem would be batching and where all the data lies.
>The world consists of chunks with dimensions 16x16x128 blocks.
Every chunk gets divided vertically in 8 mini-chunks with dimensions 16x16x16 which get rendered separately
Assuming 20 bytes per vert (xyz + uv), thats just under 3 MB per chunk, which is ~~hopefully stored in a vbo~~ stored in a display list. But,
>Minecraft renders on Far about 5000 mini-chunks (16x16x16) from which up to 1300 may be visible in the frame.
We're talking about gigs of just vertex data here, but:
>Loading the chunk data from disk (server) or generating the terrain data for new chunks.
>Parsing the chunk data to determine which block faces are visible and preparing the rendering data (vertex and texture coordinates).
>Sending the rendering data to the GPU where is gets compiled in a* fixed OpenGL display list*.
>**The chunk loading is done inside the rendering loop**
Dear lord. Not only is it doing I/O *in the rendering loop* [hint: **don't do that**], but it's constantly making new display lists [**DON'T DO THAT**] Read:
>A display list is a very heavyweight object. Building one takes a non-trivial amount of time; moreso than just uploading some data to the card. It would be better to use a streaming VBO than to keep rebuilding a display list. Indeed, it probably be faster to use **immediate mode** than to keep rebuilding the display list.
If Minecraft switched to VBO's, you could easily discard some chunk data in memory and replace it with a new chunk, while the GPU is still happily rendering the old one. If it also loaded the data asynchronously, which wasn't mentioned but I'm guessing isn't, it would also help because your renderer wouldn't be waiting for anything, it could just spit off the newly read data and continue. This here is by far 99.999999999999999999% of the problem.
On*top* of that, that's at least 1300 draw calls, which is well and beyond what you want such in an ancient library (OGL 1.2), since they're all going to be tiny.
I'm really mad that I wrote this at night, there are so many juicy, tempting, bountiful optimizations I could make if I had the source... | null | 0 | 1316146366 | True | 0 | c2k8m76 | t3_kgq62 | null | t1_c2k8m76 | t1_c2k6td8 | null | 1427606483 | 18 | t5_2fwo | null | null | null |
True | vagif | null | Why not just use factor ?
| null | 0 | 1316146430 | False | 0 | c2k8mgl | t3_kh9sr | null | t1_c2k8mgl | t3_kh9sr | null | 1427606485 | -3 | t5_2fwo | null | null | null |
True | mm23 | null | If they enable it for google apps users then users will have two identity which violates their 'real name policy'. May be that's why they are taking time to figure out how to solve that problem. | null | 0 | 1316146542 | False | 0 | c2k8mxi | t3_kgsnl | null | t1_c2k8mxi | t1_c2k7bdx | null | 1427606489 | 6 | t5_2fwo | null | null | null |
True | alecco | null | You start to sound like a bot. | null | 0 | 1316146630 | False | 0 | c2k8nar | t3_kgqxt | null | t1_c2k8nar | t1_c2k8lbi | null | 1427606492 | 7 | t5_2fwo | null | null | null |
True | bastawhiz | null | > Silverlight has (had?) huge momentum ... This is the biggest market of all
That's somewhat of a logical fallacy; despite having huge momentum, Silverlight has ALWAYS been dwarfed by Flash and web apps in EVERY market. Flash developers have been around forever. Many young programmers start with Flash (to make games or fun web apps) and branch out from there.
> And no, HTML/CSS/JavaScript does not compare.
This is somewhat dubious of a statement. Web languages are **by far** easier to program with than C# or VB.Net. There's a much lower barrier of entry, and you can get started on ANY platform very easily, not to mention the enormous community behind them.
By far, HTML/CSS/JS is the **mostly widely used platform** simply because (besides the fact that both Silverlight and Flash both run on it) for every one Flash or Silverlight-enabled web app, there's at least one that's HTML-based.
While it's true that HTML5 hasn't really taken off until this year, it's never been a platform unto itself. Flash and HTML have always complemented each other. Many Flash components exist as simple drop-in pieces to enable things that HTML didn't do natively (e.g.: SoundManager existed before <audio>). This kind of symbiosis was never practical with Silverlight because its presence was questionable at best.
While it's true that Silverlight was/is very powerful, it doesn't provide any functional benefit over an equivalent HTML5/Flash application. Comparing a Silverlight app that does the same thing as a Flash app with the same interface, neither is one iota better than the other from a usability, performance, or other functional standpoint. The only thing that differentiates the two is the company behind the solution and its support for its developers and user base. And while there's a good argument for both sides of the equation (Microsoft has provided great tools for SL), Adobe is the one that's still making great tools despite pressure to abandon their platform and Microsoft is not.
Edit: expounded on web languages. | null | 0 | 1316146694 | True | 0 | c2k8njz | t3_kgb4h | null | t1_c2k8njz | t1_c2k8gqm | null | 1428193946 | 0 | t5_2fwo | null | null | null |
True | alpenhornburberries | null | The Supplements worked I tried something similar to this plus it worked for me personally too http://tinyurl.com/64hg3sh | null | 0 | 1316146745 | False | 0 | c2k8nrp | t3_kgaop | null | t1_c2k8nrp | t3_kgaop | null | 1427606498 | -5 | t5_2fwo | null | null | null |
True | ZorbaTHut | null | > I guess that means if a single NP problem is found to be impossible to solve quickly, then ALL of them are impossible to solve quickly.
Correct. In fact, that's one of the approaches used to determine P != NP - prove that any NP-complete problem cannot be solved in polynomial time, thereby proving that all of them cannot. | null | 0 | 1316146762 | False | 0 | c2k8nuh | t3_kgfhb | null | t1_c2k8nuh | t1_c2k56te | null | 1427606499 | 1 | t5_2fwo | null | null | null |
True | rizla7 | null | wtf is wrong with people..
first you cant even be bothered to do research..
then you can't even be bothered to read an article..
now you're in complete denial..
and then you blame is on MS? | null | 0 | 1316146959 | False | 0 | c2k8oos | t3_kgqxt | null | t1_c2k8oos | t1_c2k8nar | null | 1427606516 | -2 | t5_2fwo | null | null | null |
True | onionhammer | null | haha, yeah.. I registered well in advance, but a few weeks ago I started to hear rumors that they were going to release a tablet with win 8 or a win 8 ready tablet, that definitely got me excited ;)
After a couple days with it, it's not the greatest thing ever, but they are going to keep sending out updates for it (or so they said during a keynote), so I'm hoping things get more and more stable..
| null | 0 | 1316147094 | False | 0 | c2k8p7x | t3_kewkd | null | t1_c2k8p7x | t1_c2jwh9z | null | 1427606517 | 1 | t5_2fwo | null | null | null |
True | alecco | null | Well, you seem to be in denial your magic 5 step installation requires installing extra software. And that it doesn't apply because we are not doing development based on .Net.
Edit: from your linked documentation, it says to open the "certificate snap-in", right on step 1! | null | 0 | 1316147102 | True | 0 | c2k8p90 | t3_kgqxt | null | t1_c2k8p90 | t1_c2k8oos | null | 1427606519 | 6 | t5_2fwo | null | null | null |
True | JL235 | null | Opera used to be shockingly fast, but these days I find Chrome and IE 9 perform better. Even FireFox has almost caught up with it. | null | 0 | 1316147138 | False | 0 | c2k8pdl | t3_kgb4h | null | t1_c2k8pdl | t1_c2k3uq3 | null | 1427606519 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | If it's in the "Express" edition, well, that's already competing with GCC.
Otherwise, it'll be in the "if you're prepared to pay for this, you probably paid for 3D Studio Max or something anyway, so, like, whatever, this isn't in the same league or for the same purpose. | null | 0 | 1316147605 | False | 0 | c2k8r82 | t3_kg44k | null | t1_c2k8r82 | t1_c2k4woi | null | 1427606543 | 1 | t5_2fwo | null | null | null |
True | ipeev | null | Very confusing. Does Microsoft expect someone to program for this?
| null | 0 | 1316147774 | False | 0 | c2k8rw4 | t3_kgl4f | null | t1_c2k8rw4 | t3_kgl4f | null | 1427606552 | -4 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316147876 | False | 0 | c2k8sa9 | t3_kgqnz | null | t1_c2k8sa9 | t3_kgqnz | null | 1427606557 | -4 | t5_2fwo | null | null | null |
True | rizla7 | null | right, because its available in all versions of windows since win2000, without installing additional software...
you seem to have no idea what you're talking about. there are different types of certs, that site was simply showing it from a dev perspective, the same procedure can be used for a website url.
shit, its linked right in the document... can you read for once instead of just blowing shit out your ass? http://msdn.microsoft.com/en-us/library/ms788967.aspx
maybe you incorrectly created the certificate on the web server. in which case makecert.exe info is also linked: http://msdn.microsoft.com/en-us/library/bfsktky3.aspx (er, i might be mixin gup makecert with selfssl.exe, cant remember)
or you can create it in IIS directly since iis6 i believe. | null | 0 | 1316147901 | True | 0 | c2k8sdv | t3_kgqxt | null | t1_c2k8sdv | t1_c2k8p90 | null | 1427606559 | -2 | t5_2fwo | null | null | null |
True | dnew | null | I'm surprised so few of these kinds of discussions use the idea of combination locks to explain the concept of "NP". Given a solution, it's trivial to check. Lacking a solution, every digit added to the combination multiplies the possible combinations by 10 (or however many digits on your dial, but I'm thinking like luggage locks). Pretty much everyone understands this intuitively who might not understand why splitting up piles of rocks is interesting. | null | 0 | 1316148127 | False | 0 | c2k8ta8 | t3_kgfhb | null | t1_c2k8ta8 | t3_kgfhb | null | 1427606571 | 2 | t5_2fwo | null | null | null |
True | sinrtb | null | How is a problem classified in on group or another? I and is the definition static? For example the first listed example in the link seems possible to do by breaking it down into smaller steps which would shorten the time greatly. At what point of efficiency does a problem go from NP to P? And would just finding a P solution for a current NP problem work to satisfy P=NP?
My gut says yes but my logic says no, and whenever that happens I always ask for confirmation. | null | 0 | 1316148317 | False | 0 | c2k8u0b | t3_kgfhb | null | t1_c2k8u0b | t3_kgfhb | null | 1427606580 | 1 | t5_2fwo | null | null | null |
True | LORDJEW_VAN_CUNTFUCK | null | It is for me. | null | 0 | 1316148427 | False | 0 | c2k8uf4 | t3_ke58q | null | t1_c2k8uf4 | t1_c2jlsda | null | 1427606586 | 1 | t5_2fwo | null | null | null |
True | 5-4-3-2-1-bang | null | Point = not missed. Nowhere have I read that IE10 will handle PDF files. If you have a link, share it, otherwise you're making a **wild** assumption.
And in fact, here's someone saying that [they can't open PDFs in IE10.](http://www.forumswindows8.com/general-discussion/pdf-wont-open-ie-10-windows-8-a-3863.htm) | null | 0 | 1316148544 | True | 0 | c2k8uwc | t3_kgb4h | null | t1_c2k8uwc | t1_c2k78cb | null | 1427606592 | 1 | t5_2fwo | null | null | null |
True | rosetta_stoned | null | > Imagine if you created a cross platform programming language, but your boss only lets you implement on OS X.
Except that the creators of .NET and C# did not create a cross-platform anything. They created tools and languages to tie people into Windows. Then some idiot with a nauseating streak of obsequiousness towards everything Microsoft came along and created a cross-platform version of it. Now MS have a competing version of their tools which break their lock-in on Windows. Why on earth would they love that? Answer: they don't. But they have seen a use for it, arm-twisting companies like Novell into signing patent-protection agreements with MS, thus getting one of the largest Linux distribution companies to all but admit in public that there were "intellectual property" problems with Linux.
| null | 0 | 1316148547 | False | 0 | c2k8ux1 | t3_kgl4f | null | t1_c2k8ux1 | t1_c2k753d | null | 1427606592 | 2 | t5_2fwo | null | null | null |
True | hlipschitz | null | I don't believe this to be true. You can have two identities (i.e. the "work" you and the "personal" you), but they both need to be real (i.e. no imaginary you). Sorry Harvey... | null | 0 | 1316148616 | False | 0 | c2k8v6x | t3_kgsnl | null | t1_c2k8v6x | t1_c2k8mxi | null | 1427606596 | 11 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316148630 | False | 0 | c2k8v8y | t3_kgqxt | null | t1_c2k8v8y | t1_c2k8p90 | null | 1427606596 | -5 | t5_2fwo | null | null | null |
True | sinrtb | null | The rock problem confuses me and I hope you can clarify. I assume the rocks cannot modified (cut in half). Can you have a third pile as left over rocks. If not isn't there an easy way to find out if the rocks in the pile cannot be separated evenly? Still working on that one in my head. | null | 0 | 1316148903 | False | 0 | c2k8wb4 | t3_kgfhb | null | t1_c2k8wb4 | t1_c2k44xb | null | 1427606609 | 1 | t5_2fwo | null | null | null |
True | BrainInAJar | null | If there were a technology version of the term "Uncle Tom", it'd be "Miguel de Icaza" | null | 0 | 1316148932 | False | 0 | c2k8wf9 | t3_kgl4f | null | t1_c2k8wf9 | t3_kgl4f | null | 1427606611 | -12 | t5_2fwo | null | null | null |
True | lol____wut | null | The answer is 'kinda'
Examples: Shipping companies wants to save space on the cargo planes so they want to pack all the differently sized boxes as tight as possible. Or delivery routes that need to visit a list of houses want to take the most efficient route. Stuff like that.
Currently we have algorithms that get pretty close to optimal though so getting it EXACTLY right is definitely gonna save money but not a huge amount. | null | 0 | 1316149039 | False | 0 | c2k8wud | t3_kgfhb | null | t1_c2k8wud | t1_c2k4laz | null | 1427606616 | 1 | t5_2fwo | null | null | null |
True | CubedOptimism | null | Lots of cameras use video compression schemes(like h.264) which yield hard-to-edit video because they are computationally intensive. People usually convert their media to a simpler, but less data-rate efficient codec when they edit. Apple has a stranglehold on a large part of the video editing market, and their proprietary codec, ProRes works best with their software(Final Cut Pro) So lots of people use it. This will allow ProRes files to be decoded by open source software. Such software can streamline large parts of workflows that need to be automated from the command line, or a allow people to get video into other systems it would have been hard to get it into before. | null | 0 | 1316149240 | False | 0 | c2k8xlv | t3_kgqdd | null | t1_c2k8xlv | t1_c2k8gy3 | null | 1427606627 | 31 | t5_2fwo | null | null | null |
True | lol____wut | null | 'NP-hard' problems are all known to be 'the same' in the sense that you can convert one type of NP Hard problem into another, so finding a solution for one of them will probably mean you can solve them all. | null | 0 | 1316149316 | False | 0 | c2k8xvd | t3_kgfhb | null | t1_c2k8xvd | t1_c2k8u0b | null | 1427606630 | 0 | t5_2fwo | null | null | null |
True | hater_gonna_hate | null | Perhaps it won't have built-in support. But IE10 will still have support for plugins.
As if Microsoft would drop support for ActiveX controls. Good luck getting businesses to upgrade when it'll break their entire web-based infrastructure.
EDIT: Your link quotes some random a a forum who looks like their encountering a bug in an Alpha version of Windows. I'm just going to wait a bit before making assumptions. Microsoft are not stupid. | null | 0 | 1316149415 | True | 0 | c2k8y9h | t3_kgb4h | null | t1_c2k8y9h | t1_c2k8uwc | null | 1427606635 | 1 | t5_2fwo | null | null | null |
True | lol____wut | null | Almost infinity minus one is still almost infinity | null | 0 | 1316149546 | False | 0 | c2k8yr5 | t3_kgfhb | null | t1_c2k8yr5 | t1_c2k3186 | null | 1427606643 | 1 | t5_2fwo | null | null | null |
True | gfuller23 | null | Here's my solution for P != NP
I believe that I may have found a solution to the problem of whether or not P is equal to NP. In pursuit of a solid answer to this question, I have entertained numerous possible methods of attack, but the following methods appear to be the most complete and succinct way to hammer out an answer.
Through my examination of P and NP problems, it seems to be that the prime distinction between P and NP problems is the "layers of infinite" that are used in evaluating them. Consider, for example, the 'countably infinite' sets. We call these sets "countably infinite" because there is a direct 1-1 and onto relationship to them from the set of the natural numbers. I would like to define such problems as being "infinite in only one dimension".
Consider, for example, a tree (graph) of infinite depth and of non-infinite breadth. It's pretty easy to visualize this tree as being infinite in only one dimension -- depth. The strategy to correlate this graph to the set of natural numbers is also rather simple. As has been stated before, if you attempted to do a depth-first numbering of the tree, there would be certain parts of the tree which would never be numbered. However, by taking advantage of the fact that the tree is only "infinite in one dimension", we can number the tree by taking advantage of the finite nature of all other aspects of the tree -- by numbering all elements at a certain depth before going to lower depth, we can prove via induction that the entire tree will be traversed and systematically numbered. This is a breadth-first numbering of the tree.
Note that a similar strategy also works for a tree of finite depth and infinite bredth. This tree is also infinite in only one dimension, and can similarly be numbered in a manner where the entire tree is traversed -- by doing a depth-first numbering of the tree. Note that in this case, the dimensions have flipped -- an attempt at a bredth first traversal of the tree will fail to be a proper solution to every tree of the given form (infinite bredth, finite depth) because there will never be a case where the algorithm can stop doing a breadth-first iteration to return to number elements at a lower breadth and number them.
Note that it is unimportant if the infinite element is single directional or bi-directional. IE: the set of all real numbers could be said to be infinite in two directions -- when starting at zero, there is an infinite number of elements in the negative direction and an infinite number of elements in the positive direction. However, note that the number of dimensions are the same: 1.
I appear to have arrived at a contradiction, for a two-dimensional graph can still be properly iterated upon, using a spiral pattern. However, when I refer to 'dimensions', I am not simply referring to a geometrical concept. The dimenisons of infinite in a 'two-dimensional' graph is still, in fact, 1. Consider the graph example I brought up earlier. The tree representation of the elements in a 'two-dimensional' graph has an infinite depth and a finite breadth -- 4. Positive X values, negative X values, positive Y values, negative Y values. Or, if you wish to combine positive and negative, there are two. The fact remains that one of these values is in fact still finite. A proper 2-dimensinoally infinite physical graph would have an infinite amount of axis each a host to its own dimension of an infinite set of numbers.
It seems to be to begin to become apparent that the problem of P = NP may very well be similar to the problem N = P(N). Although it has already been mathematically proven that N < P(N), I think it may be a bit premature to declare that P < NP.
It has been shown that, assuming that P = NP, then there are problems which are in NP and not in P which are also not NP-complete. This, the corollary is that if can be shown that there are no problems which are in NP, not in P, and not NP-complete, then P is not equal to NP.
I'd argue that NP and P have an asymptotic relationship. To be more specific, The class of problems which can be solved in NP time are equal to the class of problems that can be solved in P time as the amount of "time" provided for solving the problem "in P time" approaches infinity. The problems that we see as "not in P" are only the most extreme cases where there is more than one dimension of infinite sets. Take, for example, a problem with 2 infinite sets. I'd argue that this problem is NP-complete. However, if it were to have one infinite set and a second set with any number of sets that isn't infinite, it would no longer be NP-complete, and would also be P, given the method outlined above for numerability. Therefore, if it is indeed the case that P != NP, then there is no such thing as a problem which is not P, not NP-complete, but is NP. So the question is now if an "asymptotic relationship" could be defined as being equal, or being not equal. Well, there's another theory, the name of which escapes be at this point in time, which claims that there is a third class of problems, which I will call K, and it has been proven that P <= NP <= K, and P != K. If it is in fact the case that P <= K, and it is also the case that the relationship between P and NP is the same as the relationship between NP and K, then it must also be the case that this relationship is an inequality. As such, P != P
There are also some other thought that I've had on the matter of P and NP problems that I'd like to include as well.
- For all NP-complete problems, it is the case that, assuming P != NP, the non-deterministic branching set of states that the NTM enters in evaluating the input cannot be sequentially numbered, for if it could be sequentially numbered, then it could be modeled by a deterministic TM.
- It seems to me that the following is true:
P is deterministic, there is only one possible next state for any state that it has entered, though the TM can run forever.
Thus, P is big O( summation from n=1 to infinity of 1). This is equal to infinity.
NP is nondeterministic. There are no limitations on the number of states that can be in a NTM, so in essence the number of next possible steps for any step in a TM is infinite. I'm ignoring the infinite nature of the tape and the tape alphabet, as I am directly comparing TMs to NTMs, and these values remain the same for both.
As such, P is big O( summation from n=1 to infinite of infinity). Or, P is infinity added to infinity an infinite number of times.
Thus, the following appears to be true; P = NP if and only if the summation from n=1 to infinity of infinity is equal to infinity
or
inf
E inf == inf
n=1
| null | 0 | 1316149577 | True | 0 | c2k8yv9 | t3_kgfhb | null | t1_c2k8yv9 | t3_kgfhb | null | 1427606644 | 0 | t5_2fwo | null | null | null |
True | lol____wut | null | What if P = 0? | null | 0 | 1316149614 | False | 0 | c2k8yzh | t3_kgfhb | null | t1_c2k8yzh | t1_c2k5z03 | null | 1427606646 | 2 | t5_2fwo | null | null | null |
True | 5-4-3-2-1-bang | null | IE10 *in desktop mode* will have support for plugins. IE10 will, by default, *not be running in desktop mode*. (That was the whole point of the article!)
So as far as the majority of users are concerned (you and I don't count -- we can use our brains) you can't get there from here with IE10. That's really the genesis of my original comment.
| null | 0 | 1316149636 | False | 0 | c2k8z2l | t3_kgb4h | null | t1_c2k8z2l | t1_c2k8y9h | null | 1427606650 | 1 | t5_2fwo | null | null | null |
True | lol____wut | null | You're getting old | null | 0 | 1316149749 | False | 0 | c2k8zhj | t3_kfuii | null | t1_c2k8zhj | t1_c2jzpmp | null | 1427606658 | 3 | t5_2fwo | null | null | null |
True | alecco | null | Neither I or the original StackOverflow poster said it wasn't possible, just that it is *very cumbersome*; in particular relative to other operating systems (OS X 3 steps, linux copy some files, firefox run a single liner)
The point was about complicated interfaces and poor documentation and you show .Net developer documentation (not Windows 7 OS documentation).
And you keep linking to documentation on creating certificates (not the issue). And yes, the host does match, that's why it works on the other OSs/browsers.
I guess this is all my loss to spend time answering an obvious troll.
Also, it's not *my* computer. This was posted 10 hours ago. I do not have access 24/7 to a windows OS (and wouldn't bother even if I had).
| null | 0 | 1316149797 | False | 0 | c2k8zn2 | t3_kgqxt | null | t1_c2k8zn2 | t1_c2k8sdv | null | 1427606654 | 7 | t5_2fwo | null | null | null |
True | hella_bro | null | Great clarification! | null | 0 | 1316149797 | False | 0 | c2k8zn4 | t3_kgfhb | null | t1_c2k8zn4 | t1_c2k4sk4 | null | 1427606654 | 1 | t5_2fwo | null | null | null |
True | sextangles | null | I'm sure you know this, but just to note for others: Factoring is not proven to be NP-Complete. It resides in NP and co-NP, a result that falls out of the fundamental theorem of arithmetic - numbers have a unique prime factorization. Since NP ?= co-NP is still an open question, we don't know whether factoring is NP-Complete. So even if factoring were solved in P somehow, breaking RSA and Diffie-Hellman, P ?= NP is still open.
Also, the most recent big result I know relating to any number theory stuff is the AKS primality test, a deterministic algorithm that tells you whether a number is prime in a polynomial amount of time.
Another thing: Shor's algorithm is polynomial time for a quantum computer, which is in its own complexity class BQP. BQP may contain problems that lie outside of P. That is, P lies inside BQP. BQP lies within PSPACE, which lies within EXP. EXP contains key attacks (might not be a strict containment though?), so those lie outside of BQP. So the complexity class hierarchy backs you up here. | null | 0 | 1316149819 | True | 0 | c2k8zro | t3_kgfhb | null | t1_c2k8zro | t1_c2k4sk4 | null | 1427606656 | 2 | t5_2fwo | null | null | null |
True | gonemad16 | null | im still waiting for a decent google maps api for the android... what they have currently is horrendous | null | 0 | 1316149840 | False | 0 | c2k8zu1 | t3_kgsnl | null | t1_c2k8zu1 | t3_kgsnl | null | 1427606657 | 0 | t5_2fwo | null | null | null |
True | Porges | null | > (assuming the axiom of choice)
Ha! | null | 0 | 1316149859 | False | 0 | c2k8zx4 | t3_kgfhb | null | t1_c2k8zx4 | t1_c2k826m | null | 1427606658 | 1 | t5_2fwo | null | null | null |
True | 00bet | null | problem is he doesn't render each and every cube; he extracts visible surfaces--granted this is per cube and no decimation is going on.
Also I hear a lot of talk regarding octree. In actuality there is a gap between theoretical savings plus speed of octree and practice. If you want super fast access then just use an array of blocks (you can do lighting fast compression and decimation on these). Not to mention depending on how you much overhead is per node and how noisy your data is, you end up not saving as much as you though you'd save. TL;DR fast access time is king for cube games.
| null | 0 | 1316149933 | False | 0 | c2k906n | t3_kgq62 | null | t1_c2k906n | t1_c2k6td8 | null | 1427606660 | 2 | t5_2fwo | null | null | null |
True | lenish | null | I misunderstood your wording, as hotoatmeal explained to me. | null | 0 | 1316150152 | False | 0 | c2k90yo | t3_kgfhb | null | t1_c2k90yo | t1_c2k81wt | null | 1427606671 | 1 | t5_2fwo | null | null | null |
True | regeya | null | I'll comment on the 2nd paragraph, right after I say I think you're wrong about vi being closer to the UNIX philosophy.
I wish you were wrong about Emacs vs. vi. They're so vastly different form each other, though, that I fear you're right. If I could find a vim emulation mode that I liked, I'd switch to Emacs for the things I like better about it...but I can't get past the huge gulf between vi and Emacs.
Having said all that, I wish for a text editor which was more mainstream yet on par with either one. | null | 0 | 1316150181 | False | 0 | c2k9125 | t3_kgln6 | null | t1_c2k9125 | t1_c2k6u66 | null | 1427606673 | 1 | t5_2fwo | null | null | null |
True | JL235 | null | I often thought Opera was like a Ferrari. On the surface it's awesome, and you'd love to have it, but for just going to the shops, you'd rather have something else. | null | 0 | 1316150249 | False | 0 | c2k91aw | t3_kgb4h | null | t1_c2k91aw | t1_c2k2f7u | null | 1427606681 | 1 | t5_2fwo | null | null | null |
True | 00bet | null | I agree with everything you said except you can decimate meshes and texture them with the texture atlas. I'm doing this in my game but I compute normal and uvs in the shader. I decimate my mesh and yes, I have T-junction problems which I try to minimize by creating skirts (these are fast) but can still have one pixel holes; it's definitely not ideal. Also my decimation is based on RLE. No octree is involved. And problem with skirts is with lighting...I'm gonna see if I can make skirts smaller to see if the problems go away. | null | 0 | 1316150252 | False | 0 | c2k91bb | t3_kgq62 | null | t1_c2k91bb | t1_c2k8ikf | null | 1427606681 | 1 | t5_2fwo | null | null | null |
True | 00bet | null | how do you plan to solve the vertex interpolation problem when the data cannot be linearly interpolated? You can solve it by faking it with some function and it may not even work. | null | 0 | 1316150420 | False | 0 | c2k91xy | t3_kgq62 | null | t1_c2k91xy | t1_c2k8gcx | null | 1427606684 | 4 | t5_2fwo | null | null | null |
True | andyhefner | null | > Yeah I agree this sucks, but Eclipse will autocomplete generics for you so it's no so bad.
Yeah, but then you'd have to use Eclipse. Fail. | null | 0 | 1316150442 | False | 0 | c2k920s | t3_kgq62 | null | t1_c2k920s | t1_c2k7txx | null | 1427606685 | -5 | t5_2fwo | null | null | null |
True | zzing | null | I am learning fortran right now, and this code you pasted repulsed me. | null | 0 | 1316150612 | False | 0 | c2k92l1 | t3_kfvm7 | null | t1_c2k92l1 | t1_c2k2evh | null | 1427606692 | 2 | t5_2fwo | null | null | null |
True | [deleted] | null | Would open source software using it get some sort of cease-and-desist from Apple for using the encoding? I'm under the impression that these encodings are patented to hell. | null | 0 | 1316150712 | False | 0 | c2k92yo | t3_kgqdd | null | t1_c2k92yo | t1_c2k8xlv | null | 1427606698 | 7 | t5_2fwo | null | null | null |
True | rizla7 | null | look, the point is self-signed certs are a tool for developers. if you're not a developer, you have no right to complain...
if you've installed the cert in root and it still doesnt work, check event log. it works fine, and doesnt take 5 steps.. its one step... start->run->certmgr.msc
you should NEVER be able to install self-signed certs from the browser, even tough you can. the simple fact that it takes 20 steps in IE is a BONUS... allowing this sort of procedure in firefox (as you say, 1 step, hard to believe) IS a **vulnerability**... self-signed certs are for devs, not end users. | null | 0 | 1316150741 | False | 0 | c2k932f | t3_kgqxt | null | t1_c2k932f | t1_c2k8zn2 | null | 1427606699 | -3 | t5_2fwo | null | null | null |
True | jugalator | null | From my circle of friends, not at all, sadly. It seems like a ton of people signed up, many/most didn't even post a status update, and now there are just special interest groups like photographers and geeks active. I don't really bother anymore unless there's a change in activity there. I've tried being active there, hoping others would then be too, but no. So I'll pass that torch to someone else.
Also, statistics can lie, but still... It's not a minor drop here:
http://www.google.com/trends?q=google+buzz%2Cgoogle%2B%2Cgoogle+wave&ctab=0&geo=all&date=all&sort=0
| null | 0 | 1316150952 | True | 0 | c2k93tk | t3_kgsnl | null | t1_c2k93tk | t1_c2k7zi1 | null | 1427606709 | 2 | t5_2fwo | null | null | null |
True | rkenned | null | Personally, I downvoted because no social network provides any features that any of us really needs...unless of course you're really depressed and will kill yourself if no one remembers your birthday. Then I suppose social networks provide something that you truly need. | null | 0 | 1316151040 | False | 0 | c2k944y | t3_kgsnl | null | t1_c2k944y | t1_c2k6765 | null | 1427606714 | 2 | t5_2fwo | null | null | null |
True | 4ad | null | 14 years for a a platform, but how many years as a preferred, tier 1 platform? 4?
| null | 0 | 1316151047 | False | 0 | c2k945i | t3_kgl4f | null | t1_c2k945i | t1_c2k7unw | null | 1427606714 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316151144 | False | 0 | c2k94ig | t3_khcr1 | null | t1_c2k94ig | t3_khcr1 | null | 1427606717 | 1 | t5_2fwo | null | null | null |
True | gizza | null | I agree. Smartphones are definitely more than a fad, but tablets just seem like they offer the same thing but can't fit in your pocket. | null | 0 | 1316151187 | False | 0 | c2k94o2 | t3_kgb4h | null | t1_c2k94o2 | t1_c2k1j7v | null | 1427606719 | 1 | t5_2fwo | null | null | null |
True | jugalator | null | Stuff others post, who have you in one of their circles, doesn't appear in your main stream. That stuff only appears in your "Incoming" stream (the purpose of that stream), which isn't the default one. Only people _you_ follow should appear in your main stream. It all sounds strange. I suppose deleting your Reddit circle never deleted anyone actually _in_ it. So you have to delete them (not necessarily outright _block_ them) one by one. That's the only way I can explain what you're seeing. | null | 0 | 1316151337 | False | 0 | c2k955y | t3_kgsnl | null | t1_c2k955y | t1_c2k8hud | null | 1427606726 | 2 | t5_2fwo | null | null | null |
True | 1ne2wo3hree | null | So... say it correctly for us commoners? | null | 0 | 1316151588 | False | 0 | c2k9606 | t3_kgfhb | null | t1_c2k9606 | t1_c2k8hip | null | 1427606738 | 1 | t5_2fwo | null | null | null |
True | duplico | null | Thanks for the addition! I'm on much shakier ground with quantum computing than I am with crypto, and this being the Internet, I was sure I was going to accidentally let a "-hard" or "-complete" sneak in there somewhere it didn't belong. | null | 0 | 1316151765 | False | 0 | c2k96li | t3_kgfhb | null | t1_c2k96li | t1_c2k8zro | null | 1427606754 | 1 | t5_2fwo | null | null | null |
True | zenon | null | Have you seen this: http://mcp.ocean-labs.de/index.php/Main_Page ? | null | 0 | 1316151832 | False | 0 | c2k96tp | t3_kgq62 | null | t1_c2k96tp | t1_c2k8m76 | null | 1427606749 | 1 | t5_2fwo | null | null | null |
True | dyydvujbxs | null | This is what happens when non-contributors get into open source software projects as "product owners". | null | 0 | 1316152165 | False | 0 | c2k97zk | t3_kghid | null | t1_c2k97zk | t3_kghid | null | 1427606767 | 6 | t5_2fwo | null | null | null |
True | Doomfield | null | You'll basically have to dig out an old XP SP1 disc and pull it | null | 0 | 1316152237 | False | 0 | c2k9882 | t3_kejwo | null | t1_c2k9882 | t1_c2k7wsr | null | 1427606771 | 2 | t5_2fwo | null | null | null |
True | wadcann | null | >This is what platform companies DO. For example, MS introduced the VB runtime a loooong time ago - 1993? And the VB6 runtime was finalized in 1998. Apparently they announced that the VB6 runtime would not ship in Windows 8. So, 14 years of a platform. That seems like a pretty good run
The [Unix API is now over 40 years old](http://www.verticalsysadmin.com/tech/unix-manual-1st-edition/) and shows no signs of going anywhere.
EDIT: Well, okay, 39 if you want the C versions of those calls. C's a bit of a newcomer, and wasn't quite in a usable state when the Unix API was being first done. But it made it!
Long-lived APIs are good if you're a programmer, because that way you don't have to spend time learning an API and then throwing out all that accumulated knowledge and experience when the API vanishes. | null | 0 | 1316152887 | True | 0 | c2k9ab9 | t3_kgl4f | null | t1_c2k9ab9 | t1_c2k7unw | null | 1427606797 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | If only there was a button for that. | null | 0 | 1316153020 | False | 0 | c2k9ap6 | t3_kgsnl | null | t1_c2k9ap6 | t1_c2k8abw | null | 1427606801 | 13 | t5_2fwo | null | null | null |
True | adrianmonk | null | Huh? It's invite-only still, I think, but there is no real shortage of invites. | null | 0 | 1316153056 | False | 0 | c2k9atb | t3_kgsnl | null | t1_c2k9atb | t1_c2k7fht | null | 1427606802 | 3 | t5_2fwo | null | null | null |
True | KungeRutta | null | So MS can't do anything right eh? | null | 0 | 1316153081 | False | 0 | c2k9avy | t3_kgl4f | null | t1_c2k9avy | t1_c2k4y6w | null | 1427606802 | 0 | t5_2fwo | null | null | null |
True | b0jangles | null | huh? https://plus.google.com/ | null | 0 | 1316153137 | False | 0 | c2k9b2o | t3_kgsnl | null | t1_c2k9b2o | t1_c2k7fht | null | 1427606803 | -2 | t5_2fwo | null | null | null |
True | KyteM | null | Except .NET and COM are not at all the same thing. COM is a framework for components to talk with each other. .NET is a platform over which programs run.
You use COM to expose .NET components to native code, and COM/P/Invoke to expose native components to .NET. It's always been that way. Microsoft knew .NET would never replace native apps, it's why they spent so much effort in painless interop. (See: C# 4, dynamic and P/Invoke in general)
WinRT basically the streamlining of COM and bring the native part more in line with what's in the managed world in terms of features. | null | 0 | 1316153234 | False | 0 | c2k9bcu | t3_kgl4f | null | t1_c2k9bcu | t1_c2k7xio | null | 1427606807 | 8 | t5_2fwo | null | null | null |
True | worshipthis | null | The reason Minecraft is "slow" wrt the # of polys etc is because Notch is richer than you. | null | 0 | 1316153324 | False | 0 | c2k9bn2 | t3_kgq62 | null | t1_c2k9bn2 | t3_kgq62 | null | 1427606811 | -5 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316153341 | False | 0 | c2k9boo | t3_kgfhb | null | t1_c2k9boo | t1_c2k8xvd | null | 1427606811 | 1 | t5_2fwo | null | null | null |
True | KyteM | null | Er, WinForms has always been built on top of Win32. The Windows.Forms namespace is just a wrapper to the underlying Win32 API (hell, you can get the HWNDs and stuff) | null | 0 | 1316153372 | False | 0 | c2k9bsh | t3_kgl4f | null | t1_c2k9bsh | t1_c2k7aur | null | 1427606814 | 6 | t5_2fwo | null | null | null |
True | KyteM | null | It's pretty easy to guess, though. "ref" means "Ref-counted WinRT object", and I can bet $10 it also includes "derived from Platform::Object" in there.
sealed is sealed. Non-inheritable. Not much to do there.
I'm pretty sure that, once the whole thing comes out (or even now, if someone's willing to snoop around), the pure-C++ equivalents will pop up. | null | 0 | 1316153487 | False | 0 | c2k9c3t | t3_kgl4f | null | t1_c2k9c3t | t1_c2k80pr | null | 1427606826 | 2 | t5_2fwo | null | null | null |
True | newbill123 | null | One odd thing rings in my ear, but maybe I just am too cynical.
The message I've heard over and over is that your Silverlight *skills* will still be valid in metro. They don't say your *code* will be though. They've said variations of this enough that I just don't see it being accidental.
So will there just be new API's and either big migration or rewriting to do. But you'll be able to do it with the same techniques a Silverlight developer is used to?
Maybe I haven't heard the right people speak, but I just don't understand yet. | null | 0 | 1316153530 | False | 0 | c2k9c8l | t3_kgb4h | null | t1_c2k9c8l | t1_c2k2heo | null | 1427606819 | 1 | t5_2fwo | null | null | null |
True | KyteM | null | DevDiv would give an arm and leg to have their dev tools and languages be used by everyone everyone, you know.
But it's WinDiv that runs the show and *they* say the stuff stays in Windows-land (presumably).
I'm sure OfficeDiv (dunno the real short-name) would also be happy to have Office for Linux/Mac. After all, more platforms = more market. But more platforms also means less added value for Windows, soooo..... | null | 0 | 1316153655 | False | 0 | c2k9cm4 | t3_kgl4f | null | t1_c2k9cm4 | t1_c2k8ux1 | null | 1427606823 | 5 | t5_2fwo | null | null | null |
True | newbill123 | null | They haven't spoken about the ways Metro will be locked down under group policy on big networks. Perhaps it's an opportunity for goofing off at work :-) | null | 0 | 1316153682 | False | 0 | c2k9cox | t3_kgb4h | null | t1_c2k9cox | t1_c2k7tga | null | 1427606825 | 1 | t5_2fwo | null | null | null |
True | Paiev | null | Not quite. If you change "NP" to "NP-complete" then your sentence is correct. Since P is a subset of NP, there are NP problems that can be solved quickly no matter what. | null | 0 | 1316153744 | False | 0 | c2k9cwd | t3_kgfhb | null | t1_c2k9cwd | t1_c2k56te | null | 1427606835 | 0 | t5_2fwo | null | null | null |
True | [deleted] | null | My vague understanding is that those patents aren't valid everywhere -- some EU countries don't acknowledge them, so software like [ffmpeg](http://ffmpeg.org/legal.html) is perfectly legal in such places.
I think you could in principle be held liable for using such software without a license in the US. Many Linux distros require you to download patent-encumbered codecs separately... | null | 0 | 1316153754 | False | 0 | c2k9cxf | t3_kgqdd | null | t1_c2k9cxf | t1_c2k92yo | null | 1427606837 | 22 | t5_2fwo | null | null | null |
True | [deleted] | null | [deleted] | null | 0 | 1316153777 | False | 0 | c2k9czg | t3_kgl4f | null | t1_c2k9czg | t1_c2k4tvo | null | 1427606837 | 1 | t5_2fwo | null | null | null |
True | [deleted] | null | so what? | null | 0 | 1316153788 | False | 0 | c2k9d10 | t3_kgsnl | null | t1_c2k9d10 | t3_kgsnl | null | 1427606837 | 3 | t5_2fwo | null | null | null |
True | Paiev | null | >NP problems are solvable in "non-polynomial time"
Only if P != NP.
>NP problems are not P problems, because a computer can find a solution to a P problem in a reasonable amount of time, but the same is not true for an NP problem.
Some NP problems *are* P problems, and the end of this sentence assumes P != NP again. | null | 0 | 1316153970 | False | 0 | c2k9djl | t3_kgfhb | null | t1_c2k9djl | t1_c2k65u4 | null | 1427606842 | 1 | t5_2fwo | null | null | null |
True | mrkite77 | null | You're talking about multiple torches at T junctions alongside a large poly?
I thought about it, and I think I'd end up using a cubic bspline function. The light intensities at the T junctions would be the Y values, the frequency along the side would be the X values... I do have a feeling it'd create a seam though. | null | 0 | 1316154022 | False | 0 | c2k9dpe | t3_kgq62 | null | t1_c2k9dpe | t1_c2k91xy | null | 1427606844 | 0 | t5_2fwo | null | null | null |
True | adrianmonk | null | Figuring out and printing out are two totally different things. If the mere possibility of supplying a Turing machine that can print out a proof were equivalent to inventing the proof, then it would be trivial to prove any true statement.
If there were a library that contained books full of the answers to all the questions I'll ever ask, then I could get the answer to any question I wanted just by checking the book out of the library and reading it. But who is going to write the book?
And in your example, who is going to construct this Turing machine that spits out the proof? What information do they use to construct it? | null | 0 | 1316154057 | False | 0 | c2k9dt4 | t3_kgfhb | null | t1_c2k9dt4 | t1_c2k4y4w | null | 1427606844 | 1 | t5_2fwo | null | null | null |
True | mgrandi | null | can someone explain to me how people read code like this that has 4 pretty useless comments in that entire file b/libavcodec/proresdec.c ?
especially when its super complicated stuff like codecs, you think they would put a shit ton of comments for what you are doing to the codec, so maybe other people could re implement it. I just don't get how people code like this. | null | 0 | 1316154153 | False | 0 | c2k9e36 | t3_kgqdd | null | t1_c2k9e36 | t3_kgqdd | null | 1427606847 | 4 | t5_2fwo | null | null | null |
True | KyteM | null | [Like this.](http://www.sea-of-memes.com/)
(Aside: Is it me or the guy's MC-like engine's gonna end up more optimized than Notch's?)
Well, no. In Part 32 (yes, 32), the guy actually ditches the octrees, for the reasons mentioned around here. | null | 0 | 1316154190 | True | 0 | c2k9e7f | t3_kgq62 | null | t1_c2k9e7f | t1_c2k7ies | null | 1427606848 | 3 | t5_2fwo | null | null | null |
True | Gotebe | null | My understanding is that this is good.
I am sorry, but COM is the tie that binds code from assembly (if you're both sadist and masochist), from C (if you are merely a masochist) to Javascript or Python. As such, and through sheer perseverance of MS, it's the best language integration technology there is.
Now... It's complicated and barrier to entry is high (depending on the language you want to use it with; it was e.g. pretty simple with VB6). But then, what do you expect from something so comprehensive? | null | 0 | 1316154202 | False | 0 | c2k9e8g | t3_kgl4f | null | t1_c2k9e8g | t1_c2k588i | null | 1427606848 | 4 | t5_2fwo | null | null | null |
True | worshipthis | null | heard it's big somewhere they don't speak Engrish | null | 0 | 1316154254 | False | 0 | c2k9edq | t3_kgb4h | null | t1_c2k9edq | t1_c2k2f7u | null | 1427606849 | 3 | 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.