The Search for Generational Memory
نویسنده
چکیده
In 1958 Claude Cockburn recalled a meeting with three Ladino-speaking Jews in Sofia shortly after the Second World War. They explained that they were not Spaniards, but one of them added, "Our family used to live in Spain before they moved to Turkey. Now we are moving to Bulgaria." When Cockburn asked him how long it has been since his family lived in Spain, he responded that it had been approximately five hundred years. The man spoke of these events as though they had occurred "a couple of years ago."1 This famous incident has been cited frequently as an example of the relativity of historical memory. It also suggests the lengthy time over which individuals associate themselves with events which occurred generations earlier.
منابع مشابه
Generational Garbage Collection without Temporary Space Leaks for Lazy Functional Languages
Generational garbage collection is an established method for creating eecient garbage collectors. Even a simple implementation where all nodes that survive one garbage collection are tenured, i.e., moved to an old generation , works well in strict languages. In lazy languages, however, such an implementation can create severe temporary space leaks. The temporary space leaks appear in programs t...
متن کاملGenerational Garbage Collection for Lazy Functional Languages without Temporary Space Leaks
Generational garbage collection is an established method for creating eecient garbage collectors. Even a simple implementation where all nodes that survive one garbage collection are tenured, i.e., moved to an old generation, works well in strict languages. In a lazy language, however, such an implementation can create severe temporary space leaks. The temporary space leaks appear in programs t...
متن کاملGenetic Algorithms for Changing Environments
Genetic algorithms perform an adaptive search by maintaining a population of candidate solutions that are allocated dynamically to promising regions of the search space. The distributed nature of the genetic search provides a natural source of power for searching in changing environments. As long as sufficient diversity remains in the population the genetic algorithm can respond to a changing r...
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملImproving the Performance of Conservative Generational Garbage Collection ; CU-CS-784-95
As object oriented features are added to programming languages such as C demands upon dynamic memory allocation systems increase Prototyping languages such as Smalltalk and LISP have long rec ognized the impact of garbage collection on improving reliability and programmer productivity but providing garbage collection in C is hard because pointers are di cult to reliably identify Conser vative g...
متن کاملImproving the Performance of Conservative Generational Garbage Collection
As object oriented features are added to programming languages such as C demands upon dynamic memory allocation systems increase Prototyping languages such as Smalltalk and LISP have long rec ognized the impact of garbage collection on improving reliability and programmer productivity but providing garbage collection in C is hard because pointers are di cult to reliably identify Conser vative g...
متن کامل