FTB-C000474 / Implementation concept

ATR Recursive Memory

ATR Recursive Memory is the theoretically unbounded tail of prior influence created by Wilder's recurrence.

Also known asATR infinite-tail memory

Intermediate 1 linked topicPublished

Definitions

In plain terms

Every valid update reduces old influence but does not set it exactly to zero at a fixed window boundary.

Technical

A revision before or at the seed can propagate through every later ATR state unless the implementation explicitly restarts state.

Scope

The practical effect may become numerically tiny, but that is different from finite-window expiration.

Examples

  • A reviewer traces ATR Recursive Memory from aligned inputs through its first-ready row and edge cases before accepting a displayed value.

Common misconceptions

  • The practical effect may become numerically tiny, but that is different from finite-window expiration.

Concept relationships

Prerequisites

Related

Contrasts with

Required by

Where this concept is used

Evidence and governance

  1. Average True Range TA-Lib · first party technical publication

    Supports: preferred label, short definition, technical definition

    Limits: Seed, smoothing convention, lookback, and missing-bar handling must be declared for reproducible use.

  2. TA-Lib Average True Range Reference Implementation TA-Lib · first party technical publication

    Supports: preferred label, short definition, technical definition

    Limits: TA-Lib readiness follows its own unavailable-first-TR convention and therefore differs from the local alignment.

Reviewed by
fintech-builder-batch-009
Last reviewed
2026-07-30
Next review
2027-07-30
Record status
published