Also tape is much cheaper to produce than platters especially at large volumes.
A new reel of Ampex 2" tape is $375.00 currently: https://vintageking.com/atr-magnetics-studio-master-tape-blu...
Not sure that prediction holds up (although streaming dbs in the cloud seem awfully "tape-like" to me?), but I did attempt to quickly redo his "5 minute rule" calculations: https://news.ycombinator.com/item?id=42125052
If I did the math right, there's no point to swap or paging anymore, as the break-even point I got was evict after 1 week* (instead of 5 min) for random access patterns, and evict after 5 hours for sequential access patterns.
These days maybe those breakeven calculations would be more useful for deciding how long to keep something in a register and when it'd be better to recalculate or spill to main memory?
* of course, if you keep everything in main memory and forget nothing, we're close to what in 1998 was one of McCarthy's pipe dreams: Elephant2000 http://www-formal.stanford.edu/jmc/elephant/elephant.html ; I guess if I were to attempt something like Elephant2038, it'd wind up looking like a bunch of past-oriented LTL formulae?
(the "speech acts" were probably Winograd's influence?)
Of course, these Nobel Bauble driven days, “quantum memories” sound like little more than search engine bawdlerised AdWords..
(for Xφ, I prefer to define it as relative to a given frame: φ holds the next time any of the frame variables change, which allows both continuous<->discrete translation and for Lamport's stuttering [to allow abstraction!])
Next up: GC via creation and annihilation operators? (in my algebraic view of informatics, one is often either structuring by cleaving two parts to make a whole, or destructuring by cleaving a whole into two parts)
EDIT: and by past-oriented I mean using "was ever" for "eventually" and in the past for "globally", as well as "since" for "until". rotate t by i^2. Eg
dirty := F{edit} U ({save} ∨ {load})
says the local buffer differs from the cloud if there was ever an edit since a save or load.EDIT 2: ...and I'm pretty sure I can autogenerate code that turns these kinds of def'ns into an imperative event-driven state machine; one can of course come up in theory with formulae that require an arbitrarily complex implementation, but I think in practice most def'ns (especially if we provide backpressure by signalling the complexity of the resulting imp) would be satisfied with simple ones.
Not sure when i’ll get there praying for a serendipitous intersection of cargoculting nonsssociativity and diagram spelunking (aided by your hints, half-remember’d)
Although… i confess to doing the trivial thing of drawing the “cayley graph” of {rock,paper,scissors} and observing that it looks like a loopfree 3-vertex term (1 outgoing)
Can we triage our ikigai such that I (sympathising with my machinery) take all your overly-associative structures and you (communing with the universe?) take all my insufficiently-associative structures?
(there are many in maths: eg topologies, being families of sets, can be represented by a particular magma)
Lagniappe: https://www.georgehart.com/triad.html
For instance, in the Boom Hierarchy* (sets,bags,lists,trees) we can represent the information carried by any of the structures by any of the others (exercise!) despite the fact that operations on that information may be made easier or more difficult by the presence or lack of laws (idempotency,commutativity,associativity) that are the linear delta-edges between those types-as-vertices themselves.
[IIRC, magmas would be mobiles, and I'd bet we can extend the above to them as well.]
* I know I repeat these often, but hey, I'm not alone: gopher-the-language was inspired by a "go" lemma-function in someone's sol'n to samefringe.
I'd been at peace if you mentioned the triples, but it's too late now..
Of course, absent those restrictions, it's doing way more work than it can possibly handle.
But not the references inside apple boxen
(shouldn't all messages be in \pi sooner or [much, much...] later?)
[does the def'n of "message" include finite length?]
>Sagan's friend physicist Kip Thorne gave Sagan ideas on the nature of wormholes when Sagan was developing the outline of the novel.
> Aug 23: CloudNordic said: “The attackers succeeded in encrypting all servers’ disks, as well as on the primary and secondary backup system, whereby all machines crashed and we lost access to all data.”
For big data transfers, this still holds true.
The drives and the software are the problem.
Drives are very expensive and there isn’t much non enterprise software to manage tape backups.
Enterprise software is expensive and you won’t likely be even able to buy it and since cloud storage and NAS became commoditized all the backup software that targeted small businesses pretty much either died off or went cloud backup only.
You've probably been reading bad sources. There is a very real relationship between the number of P/E cycles that a piece of flash memory has been through and the unpowered data retention it can provide. Lots of publications and even more random forum posts repeat statements about SSD data retention without including the caveat that the numbers apply specifically to worn-out drives. Brand new flash memory can easily have unpowered data retention in excess of a decade.
If you're reading a source that claims SSD unpowered data retention is only a year, and that source does not qualify that with a statement about the prior condition of the drive, you should assume that you're reading another misinterpretation of the JEDEC standards.
An LTO 9 tape has over a kilometer(!) of tape in it.
You can spool the tape only so fast without risking damage to either the tape itself or the cartridge so if your file is at the end of the tape you’ll be waiting for a while.