804 karma · joined July 10, 2013
This is especially true of term project courses, where the final portion of the project to which you devote the most time and creativity is also the part for which you're likely to receive the least feedback.
I also did BS and MS at GT, and while I generally share your experiences there were 3 or 4 truly disappointing classes during my MS. They didn't ruin my overall experience, but I can see how someone could happen to have more experiences like those and fewer positive ones and come aware with a very different perception of course quality.
My overall opinion of GT is mixed, but rigor or the courses is not one of my top critiques.
My BS CS was also from GT (several years before), so much of the core course list available online were slightly more rigorous retreads of distributed algorithms, simulation architectures, etc. already covered late in undergrad. The most valuable courses in my MS were special topics courses that, at least at the time, weren't available online, many of which were in other departments as part of the computation + application domain interdisciplinary approach of the program.
That said, the core courses that were also offered online were generally quite good, and a few were exceptionally great. Rich Vuduc's HPC applications course comes to mind.
It's also odd because you're replying to a well-known game designer.
That said, there are allocation-heavy workloads for which GC is well suited.
Cargo is a wonder. It's more limited in scope than something like CMake, but for the vast majority of use cases that are just pulling in a library or binding from the same language, it's spectacular.
Related to this, having an opinionated lint built into the tooling creates a common, readable dialect for the ecosystem. This is especially important for verbose syntax languages like Rust or C++. There are C++ libraries I can't understand simply because special snowflake formatting combined with complex template syntax renders it illegible.
I trust Facebook with the information I explicitly share with it, i.e., posting photos or comments on Facebook. I do not trust Facebook to have unfettered access to a microphone, camera, and activity just to be able to play a game. The Facebook integration was, well, integral, and not just an opt-in for enhancing social aspects. You can't use the headset to play local content without phoning home (short of using old drivers/OpenVR or something).
Of course maybe this still places me in a minority of users because I have the same reaction when a mobile app requests every permission possible, which seems to be the case with all apps now.
USAA has a great watch app, though, which somehow has many fewer reliability/latency problems than every other app. I can do most of my banking just walking down the hall while my phone is locked up at my desk.
There are tons of well-researched machine architectural models for complexity analysis. In the case of the article, any one of the many external memory (EM) or hierarchical memory models would be appropriate. These can capture latencies and bandwidth of hierarchical memories and storage, and in some cases even eviction, contention, partition, etc.
This isn't some esoteric point. In high performance computing, distributed algorithms, or even systems & architecture it's pretty much expected that if you talk about complexity, you should do so under some sort of EM model.
The only thing the article suggests is that the author's /usr/bin only includes about 2/3rds of possible x86 instructions, and that a few instructions occur most. The latter is unsurprising and expected in almost any grammar or formal system. The former is also expected given that most specialized instructions are for specialized use in high-performance applications, which are not likely all to be in any individual workstation's /usr/bin.
The cruft of specialization is legacy instructions, which as many other comments in this thread point out are usually implemented through microcode only. They don't contribute to complexity of the processor (which can choose to inefficiently implement this with other microinstructions) or the compiler (which can choose to not emit them).
I'm all for new blood in general-purpose architectures, but the bloat and inelegance of x86 isn't really something that's mattered for at least a decade.
> - Why do compilers not strive to simplify their code-gen phase, or enable themselves to do advanced instruction-level program analysis, or both?
Because specialized instructions formalize invariants and constraints on behavior that allow efficient computation, often by specialized hardware.
> - Why do microprocessors not strive for simplicity, implement only a handful of instructions in an optimized way, with a very small chip footprint, to be followed by proliferation of cores (think 256-core, 512-core, 1024-core).
Some do, see GPUs and coprocessors like the Phi. We don't take this approach with CPUs because real problems often require complex, branching, inhomogeneous computation, which require the type of specialization and tradeoffs mentioned above.
Watching NBC's broadcast, in contrast, made it seem like NBC had no belief that any of the events were interesting in and of themselves.
Regarding the hook in the headline -- computers surpassing pathologists -- it's a bit like automated driving in that even if true the immediate problem is the social and economic system. That is, we're not going to be removing the pathologist from the diagnostic and prognostic process anytime soon for many reasons, so how instead do we leverage machine learning in concert with the human observer to improve the diagnostic system? For that reason, decision introspection may be as valuable a topic of research as improving classification accuracy: justifying a particular automated classification to the pathologist, directing them to representative regions, and describing regions of feature space in biological terms.
[1] http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6945104
However, I can't imagine why any commercial entity would be interested in burning cash in LEO, unless they have a very lucrative microgravity production requirement. But so far that scenario has just been a fable.
http://outerra.blogspot.com/2012/11/maximizing-depth-buffer-...
The lack of marketing and immaturity of platform and user experience mean the most viable demographic is existing PC gamers. However, existing PC gamers are adverse to markups for what are basically SFF PCs, and are much more inclined to build their own (or buy a lower markup, non-Steam branded PC) to fill that niche. More affluent parts of the demographic less concerned about markup also tend to be older and prefer something more subtle than the gaming glitz styling and branding of most of the premium Steam machines.
There's also self-cannibalism in this demo. Few of the Steam machines are top-tier components for the sake of heat and noise, so it's easy for most existing PC owners to fill this niche by simply replacing their current PC (as most do every few years) and demoting the old box to the TV room. As you mentioned, Steam link or NVIDIA's in-home streaming on Shield TV can also fill most use cases (at least they do for me).
Valve could have leveraged the initial hype and novelty of Big Picture and the Steam machine concept to drive an initial wave of sales, but the delay between those announcements and a consequential number of actual machines being ready to buy outlasted the initial hype.
Obviously not. We've been doing this for decades and are still making the same mistakes with costly effects. Humans are as much a part of technological systems as the language or platform; continuing to ignore that even educated, disciplined, skilled developers are prone to certain classes of errors -- errors that could be obviated by other components of the system -- is hubris. It is much more feasible to create tools that exclude certain classes of error than to create less fallible developers.
> (code size; execution speed; random latencies)
Rust is not GC'ed, has no inherent reason to be slower than C (as the toolchain matures), and I doubt is more verbose than C code that provides the same safety.
1. An exclusive lock on the table, which is slow as hell 2. A PGPSQL function that attempts to INSERT, catches the duplicate key exception and instead UPDATEs (also handling the case that the row vanishes), which is slower than hell
This is why ON CONFLICT is such a huge deal. If it were as simple as checking keys with a SELECT then sending some to INSERT and some to UPDATE it would just be nice syntax sugar.