2 ms·
> Constructor Theory https://en.wikipedia.org/wiki/Constructor_theory#Outline https://en.wikipedia.org/wiki/Constructor_theory#Outline Task, Constructor, Comp
by westurner 9y ago
> Constructor Theory
https://en.wikipedia.org/wiki/Constructor_theory#Outline https://en.wikipedia.org/wiki/Constructor_theory#Outline
Task, Constructor, Computation Set, Computation Medium, Information Medium, Super information Medium (quantum states)
The filing cabinet and disk storage are information mediums / media.
How is the desktop / filling cabinet metaphor mismatched or limiting?
There may be multiple desktops (RAM/Cache/CPU; Computation mediums): is the problem parallelizable?
Consider a resource scheduling problem: there are multiple rooms, multiple projectors, and multiple speakers. Rooms and projectors cost so much. Presenters could use all of an allotted period of time; or they could take more or less time. Some presentations are logically sequence able (SHOULD/MUST be topologically sorted). Some presentations have a limited amount of time for questions afterward.
Solution: put talks online with an infinite or limited amount of time for asynchronous questions/comments
Solution: in between attending a presentation, also research and share information online (concurrent / asynchronous)
And, like a hash map, make the lookup time for a given resource with a type(s) ~O(1) with URLs (URIs) that don't change. (Big-O notation for computational complexity)
Resource scheduling (SLURM,):
https://news.ycombinator.com/item?id=15267146 https://news.ycombinator.com/item?id=15267146