That said, I loved Anathem, so perhaps something of your theory tracks :)
2,421 karma · joined February 21, 2007
jonolson at google dot com
Opinions are my own, not those of my employer.
That said, I loved Anathem, so perhaps something of your theory tracks :)
It just uses --force and leaves you with a corrupt filesystem.
I suppose that's only really funny in a "you had to be there, and not be me" sense.
That first generation also included the ability to apply a handful of fixed activation functions, but really that's about it. The array is bigger than 32x32, also.
- VMs with SSDs can (in general -- there are exceptions for things like GPUs and exceptionally large instances) live migrate with contents preserved.
- GCE supports a timeboxed "restart in place" feature where the VM stays in limbo ("REPAIRING") for some amount of time waiting for the host to return to service: https://cloud.google.com/compute/docs/instances/host-mainten.... This mostly only applies to transient failures like power-loss beyond battery/generator sustaining thresholds, software crashes, etc.
- There is a related feature, also controlled by the `--discard-local-ssd=` flag, which allows preservation of local SSD data on a customer initiated VM stop.
Persistent Disk is not backed by single devices (even for a single NVMe attachment), but by multiple redundant copies spread across power and network failure domains. Those volumes will survive the failure of the VM to which they are attached as well as the failure of any individual volume or host.
There is no network in the way, you are either misinformed or thinking of a different product.
The GP is incorrect.
There are also multiple Persistent Disk (https://cloud.google.com/persistent-disk) offerings that are backed by SSDs over the network.
(I'm an engineer on GCE. I work directly on the physical hardware that backs our virtualization platform.)
You lose data space for syndrome bits. This is not, in practice, different from fixing data space and adding chips for syndrome bits, but it reflects differently in specs.
I suspect it links here: https://support.google.com/a/answer/12005619?sjid=1774262812...
> I don't think OpenAI board has any responsibility to care for Microsoft's stock price.
They control an entity that accepted $10B from Microsoft. Someone signed that term sheet.
My curiosity stems from whether the board was involved in signing the contract for Microsoft's investment in the for-profit entity, and where the state might set the bar for fraud or similar crimes. How was the vote organized? Did any of them put anything in writing suggesting they did not intend to honor all of the terms of the agreement? Did the manner in which they conducted this business rise the level of being criminally negligent in their fiduciary duty?
I feel like there are a lot of exciting possibilities for criminality here that have little to do with the vote itself.
... and also +1 to your whole last paragraph.
I do not believe it is possible for them to have thought this through. I believe they'll have read the governing documents, and even had some good lawyers read them, but no governance structure is totally unambiguous.
Something I'm immensely curious about is whether they even considered that their opposition might look for ways to make them _criminally_ liable.
It never would have occurred to me to visit an Amazon office, so I didn't know about the ticket thing. I rarely worked with anyone remote.
When I joined, Google encouraged travel (less so lately). In the time I've been here I've visited over a dozen offices around the world. Some of them on vacation, because I knew there would be something unique about the local office, but also because with the exception of one office (Copenhagen), I'd worked closely enough with someone there to drop by their desk, say hello, shake hands, and get the best restaurant and bar recommendations I've ever found (and some great unexpected dinners with colleagues!)
- Yes, typically we can refinance whenever we like, _but_ it extends the mortgage for a 30 year term, along with additional direct immediate costs (plus human inertia). Unless interest rates were alarmingly high for your last go-round (ehem), you're directly incentivized and indirectly likely to not do so.
- I own properties in Canada (yay Commonwealth!). The notion of a 30-year fixed does not exist. One can get a 25-year amortization, but typically only with a 5-10 year guarantee for a fixed rate.
- As an American, Canadians are insane for buying into this system. Our system is so much more favorable to anyone with good enough credit to be approved for a loan it's literal comedy. Also our standards for approving someone for a loan seem to be lower (that said, I had no credit history in Canada when I started this adventure, so perhaps residents get a better deal).
- As a property investor, I'm happy to control for the cash I sink into my investments in interest versus the returns I get from rental revenue. Combining that with exchange rates and US interest rates versus Canadian, I <3 Canada.
- Fully variable interest mortgages are for suckers (and in that regard, I do have some regrets).
(bias: I <3 Canada regardless -- I'd live in Whistler, BC if circumstances allowed)
I tried to find a use for the Epiphany cores, but the speeds and feeds were too unbalanced for anything I was looking at at the time.
The way that particular story played out suggests that I wasn't alone.
I personally don't find them useful for quick / short / informal communication like email, or at least not yet.
- If you walk backwards from where the non-deterministic Turing machine halted, the list of taken state machine transitions is polynomial in length (naturally, as the machine stopped in polynomial time).
- Walking that polynomial length list of actually-taken edges forward through the Turing machine constitutes a polynomial time verification of the solution.
This is the essence of the equivalence between being able to solve problems in NP in polynomial time on a (hypothetical) non-deterministic Turing machine and being able to deterministically verify a solution to those problems in polynomial time.
Constant-rate TSCs are ~15-20 years old. Synchronized TSCs are at least ten.
Also RDTSC produces a 64-bit result, so it does not overflow at a rate of several Hz.
If it's a graph of potential stacks, though, wouldn't you eventually find the one that unwinds, if one exists?
I was working for Amazon's bet (AmazonLocal -- https://local.amazon.com/) at the time. It lasted a bit longer, but was also eventually shut down.