2
votes
Is there any computation formalism based on general relativity?
The reason quantum computing is useful is not (just) that the problems in QM are applicable to problems that'd we'd like to solve in computing generally, but because we can physically realize setups ...
- 153
1
vote
Memory efficient undo data structure
Yes. A relevant technical term is 'persistent data structure'. (See also persistent-data-structure.) There are many techniques for building persistent versions of standard data structures (trees, ...
D.W.♦
- 154k
Only top scored, non community-wiki answers of a minimum length are eligible