The ordinary concept of death is analysed and compared with revisionary medical definitions, especially those based on irreversible loss of brain function. Prior critics of revisionary definitions have focused on the locus, the brain; I am concerned with the irreversibility condition. I argue that 1) the irreversibility condition is ambiguous, 2) it has unacceptable epistemic and other conseque...

We start with a modular K-system that possesses Anosov endomorphisms in both time directions. We extend the system via a crossed product construction. If one of the Anosov endomorphisms can be extended, then also the other one. Also the extensions form a Moebius group and allow a time reeection operator that implements on the algebra an antiisomorphism.

At two x ray examinations in 1957 and 1967, 17 cases of skeletal fluorosis were identified among long term cryolite workers in Copenhagen. In 1982 four of these patients were alive, eight to 15 years after exposure had ended. Radiographs were obtained, and the urinary fluoride excretion was measured. A similar picture emerged in all four cases: extensive fading of the sclerosis of trabecular bo...

We investigate the reversibility of laser filamentation, a self-sustained, non-linear propagation regime including dissipation and time-retarded effects. We show that even losses related to ionization marginally affect the possibility of reverse propagating ultrashort pulses back to the initial conditions, although they make it prone to finite-distance blow-up susceptible to prevent backward pr...

We prove that the chordal SLEκ trace is reversible for κ ∈ (0, 4].

Reversibility enables a program to be executed both forwards and backwards. This ability allows programmers backtrack the execution previous state. is essential if computation not deterministic because re-running may lead that state of interest. sequential programs has been well studied strong theoretical basis exists. Contrarily, reversibility concurrent still very young, especially in practic...

The usual general-purpose computing automaton (e.g.. a Turing machine) is logically irreversibleits transition function lacks a single-valued inverse. Here i t is shown that such machines may he made logically reversible at every step, while retainillg their simplicity and their ability to do general computations. This result is of great physical interest because it makes plausible the existenc...

This paper introduces the annulus SLEκ processes in doubly connected domains. Annulus SLE6 has the same law as stopped radial SLE6, up to a time-change. For κ 6= 6, some weak equivalence relation exists between annulus SLEκ and radial SLEκ. Annulus SLE2 is the scaling limit of the corresponding loop-erased conditional random walk, which implies that a certain form of SLE2 satisfies the reversib...

We consider the numerical integration of two types of systems of differential equations. We first consider Hamiltonian systems of differential equations with a Poisson structure. We show that symplectic Runge-Kutta methods preserve this structure when the Poisson tensor is constant. Using nonlinear changes of coordinates this structure can also be preserved for non-constant Poisson tensors, as ...