-
101
Terminal holographic complexity
Published 2018-06-01“…Abstract We introduce a quasilocal version of holographic complexity adapted to ‘terminal states’ such as spacelike singularities. We use a modification of the action-complexity ansatz, restricted to the past domain of dependence of the terminal set, and study a number of examples whose symmetry permits explicit evaluation, to conclude that this quantity enjoys monotonicity properties after the addition of appropriate counterterms. …”
Get full text
Article -
102
Terminal lucidity phenomena
Published 2016-09-01Subjects: “…Terminal lucidity…”
Get full text
Article -
103
-
104
-
105
-
106
-
107
-
108
EXTREME AND TERMINAL STATES
Published 2010-01-01“…<p><em></em><strong></strong><em>Author brings modern conception of extreme and terminal states, their types, likenesses and differences, etiology, key common chains of pathogenesis, principles and methods of their treatment. …”
Get full text
Article -
109
-
110
-
111
Termine und Veranstaltungen
Published 2023-05-01Subjects: “…Termine und Veranstaltungen…”
Get full text
Article -
112
-
113
Algebraic Notions of Termination
Published 2011-02-01“…Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. …”
Get full text
Article -
114
-
115
-
116
Terminal Satisfiability in GSTE
Published 2014-01-01“…There are four efficient methods to verify whether a circuit model obeys an assertion graph in GSTE, Model Checking Strong Satisfiability (SMC), Model Checking Normal Satisfiability (NMC), Model Checking Fair Satisfiability (FMC), and Model Checking Terminal Satisfiability (TMC). SMC, NMC, and FMC have been proved and applied in industry, but TMC has not. …”
Get full text
Article -
117
-
118
-
119
-
120