Skip to main content
memoryless

memoryless

7.6
A system that does not depend on what happened before
  • adjective
  • /ˈmɛməriˌlɛs/
  • Specialized
translation icon : sin memoria
  • This approach is used to derive simple memoryless algorithms for two types of online problems. We derive a simple algorithm, which is memoryless and randomized, for the k-server problem in a metric space with n points.
  • memoryless algorithm

Examples

  • This algorithm, using no information from the past, is memoryless; it uses up to log m random bits, where m is the cache size, on each request.

    Academic text (1994)
  • The normal assumption with "random variables" is that they are "memoryless"; that is, it does not matter in which direction you traverse the probability curve or how fast the mapping remains the same.

    Blog text (7)
  • We saw previously or discussed the fact previously that the squarer is a memoryless system.

  • OK, the next topic that we're going to take up is discrete memoryless sources.

  • Note that Gambler is memoryless.

    Academic text (1994)
  • We develop and analyze memoryless randomized online algorithms for the caching problem and its generalizations.

    Academic text (1994)
  • Any memoryless online caching algorithm has an oblivious competitiveness coefficient that is greater than or equal to m when m = M.

    Academic text (1994)
  • The algorithm executes a random walk on the graph according to these transition probabilities. Notice that a probabilistic traversal algorithm is memoryless. Let h(i, j) be the expected cost, or distance, of a random walk that starts at node i and ends when node j is first reached.

    Academic text (1994)
  • A memoryless system processes each request independently, without any reference to previous inputs.

  • In a memoryless algorithm, the output is determined solely by the current input, ignoring past states.

Synonyms

stateless
vsmemoryless
  • Specialized
1 6.0

Not keeping information about previous requests

is the same meaning but used as an alternate adjective form
Markovian
vsmemoryless
  • Specialized
9.7

A system where the future depends only on the present state, not on past events

is broader, applying to any system not remembering past states

Antonyms

stateful
  • Specialized
1 7.1

A system that keeps information about past interactions

Surface Forms

memoryless positive

Morphology

memoryless = memory (transparent) = memory + less

Formed from the noun 'memory' + productive suffix '-less' meaning 'without', so the meaning is directly derived.

Etymology

Memoryless is made from memory and the ending -less, which means 'without' (just like in careless), so it describes a system or process that works 'without memory' and does not keep or use its past states.