25 research outputs found

    Policy Interaction, Expectations and the Liquidity Trap

    Get PDF
    We consider inflation and government debt dynamics when monetary policy employs a global interest rate rule and private agents forecast using adaptive learning. Because of the zero lower bound on interest rates, active interest rate rules are known to imply the existence of a second, low inflation steady state, below the target inflation rate. Under adaptive learning dynamics we find the additional possibility of a liquidity trap, in which the economy slips below this low inflation steady state and is driven to an even lower inflation floor that is supported by a switch to an aggressive money supply rule. Fiscal policy alone cannot push the economy out of the liquidity trap. However, raising the threshold at which the money supply rule is employed can dislodge the economy from the liquidity trap and ensure a return to the target equilibrium

    Substitutions and Strongly Deterministic Tilesets

    No full text
    Abstract. Substitutions generate hierarchical colorings of the plane. Despite the non-locality of substitution rules, one can extend them by adding compatible local matching rules to obtain locally checkable colorings as the set of tilings of finite tileset. We show that the resulting tileset can furthermore be chosen strongly deterministic, a tile being uniquely determined by any two adjacent edges. A tiling by a strongly deterministic tileset can be locally reconstructed starting from any infinite path that cross every line and column of the tiling

    The transitivity problem of Turing machines

    No full text
    International audienceA Turing machine is topologically transitive if every partial configuration — that is a state, a head position, plus a finite portion of the tape — can reach any other partial configuration, provided that it is completed into a proper configuration. We characterize topological transitivity and study its computational complexity in the dynamical system models of Turing machines with moving head, moving tape and for the trace-shift. We further study minimality, the property of every configuration reaching every partial configuration
    corecore