... have a copy on a hard drive ... — Shawn
In computing, memoization or memoisation is an optimization technique used primarily to speed up computer programs by storing the results of expensive function calls to pure functions and returning the cached result when the same inputs occur again. — Wiki
A memoized function "remembers" the results corresponding to some set of specific inputs. Subsequent calls with remembered inputs return the remembered result rather than recalculating it, thus eliminating the primary cost of a call with given parameters from all but the first call made to the function with those parameters. — Wiki
Yes, then there's nothing much to further discuss. I did some work on Godel coding for compression algorithms with countable denumerable alphabets, such as color encoding like RGB for satellite TV to deliver true 4,8,12K video. It was a fun task that led me to believe that every denumerable ordered task can be sped up or optimized by actually archiving the read to the CPU with already post-processed information, and thus labeling it as if a "brick" to every further task to be done on similar logic. Eventually, with so many bricks, you could compile the task on the CPU, to just be read out to the memory. To process the information wouldn't be anything too far-fetched; but, the archive file might be quite big to cache. The optimization might be quite profound in my mind. — Shawn
Is this something that is done already on hardware, or only on software to this day? — Shawn
Is this something that is done already on hardware, or only on software to this day? — Shawn
Do remember that Turing's paper is an undecidability result. Not everything is Turing Computable, which would be very useful for us. Hence you are really stretching it when you conclude that "then past states will elucidate future states of a process given enough time".Given that everything in Turing Computability is decidable, and hence deterministic, then past states will elucidate future states of a process given enough time.
- What are your thoughts about this? — Shawn
being the most recognizable for me.math coprocessor — wonderer1
[edit] Reading your post again, you want to store the complete state? But in a 1kB memory, there are 2^(1kB) possible states. So in any new state, you want to search your harddisk to see if you have done this already? This explodes. — Carlo Roosen
Next step is to work it out in a table, a diagram or in pseudocode, with the number of bits for each step. Maybe you found some magical loophole, but I believe you made a logical error somewhere. I am unable to give more feedback without more details. — Carlo Roosen
Also, please comment on the rest of my answer because you leave a lot of things unclear. Do you want to capture the full memory state of a computer at every clock cycle? If not, what do you select and based on what? — Carlo Roosen
My point is that you are not specific enough. You'll need to define more precisely what you are doing. Including some calculations of the processing time and memory demands. — Carlo Roosen
Now it sounds a bit like "could we use a generator to stop a truck instead of normal breaks, and reuse the energy?" - probably yes, but why aren't they doing it everywhere? — Carlo Roosen
LLM's for instance require a randomizer. In fact, after reading this remark I'll change "My point is that you are not specific enough." to "You seem to be dreaming" — Carlo Roosen
Get involved in philosophical discussions about knowledge, truth, language, consciousness, science, politics, religion, logic and mathematics, art, history, and lots more. No ads, no clutter, and very little agreement — just fascinating conversations.