AI & ChatGPT searches , social queriess for ALTERNATING TURING-MACHINE
Search references for ALTERNATING TURING-MACHINE. Phrases containing ALTERNATING TURING-MACHINE
See searches and references containing ALTERNATING TURING-MACHINE!
Search references for ALTERNATING TURING-MACHINE. Phrases containing ALTERNATING TURING-MACHINE
See searches and references containing ALTERNATING TURING-MACHINE!ALTERNATING TURING-MACHINE
Abstract computation model
An alternating Turing machine (or to be more precise, the definition of acceptance for such a machine) alternates between these modes. An alternating Turing
Alternating_Turing_machine
Computation model defining an abstract machine
Church's work intertwined with Turing's to form the basis for the Church–Turing thesis. This thesis states that Turing machines, lambda calculus, and other
Turing_machine
Type of Turing machine
science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in his seminal paper
Universal_Turing_machine
Hypothetical computing device
"library" can be printed. Turing machine Universal Turing machine Alternating Turing machine Probabilistic Turing machine Turing machine equivalents Sipser,
Multitape_Turing_machine
Model of quantum computation
A quantum Turing machine (QTM) or universal quantum computer is an abstract machine used to model the effects of a quantum computer. It provides a simple
Quantum_Turing_machine
Mathematical model of computation
probabilities for the transitions, probabilistic Turing machines can be defined as deterministic Turing machines having an additional "write" instruction where
Probabilistic_Turing_machine
Type of recurrent neural network
A neural Turing machine (NTM) is a recurrent neural network model of a Turing machine. The approach was published by Alex Graves et al. in 2014. NTMs combine
Neural_Turing_machine
Abstract calculator
"Post–Turing program" and "Post–Turing machine" were used by Martin Davis in 1973–1974 (Davis 1973, p. 69ff). Later in 1980, Davis used the name "Turing–Post
Post–Turing_machine
List
Scotland Turing jump Turing Lecture Turing machine Alternating Turing machine Multi-track Turing machine Multitape Turing machine Neural Turing machine Non-deterministic
List of things named after Alan Turing
List_of_things_named_after_Alan_Turing
Turing machine that halts for any input
relationship between partial Turing machines and total Turing machines: Can every partial function computable by a partial Turing machine be extended (that is
Decider_(Turing_machine)
Computer science concept
within PSPACE. The hierarchy can be defined using oracle machines or alternating Turing machines. It is a resource-bounded counterpart to the arithmetical
Polynomial_hierarchy
Theoretical model of computation
computation with a deterministic computer. Alan Turing first developed the concept of Turing machine in 1936, imagining it as a simple computer that reads
Nondeterministic Turing machine
Nondeterministic_Turing_machine
Hypothetical computing devices
A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936. Turing machines manipulate symbols on a potentially infinite
Turing_machine_equivalents
to supplement the article Turing machine. The following table is Turing's very first example (Turing 1937): "1. A machine can be constructed to compute
Turing_machine_examples
Algorithmic complexity class
solved by an alternating Turing machine in polynomial space. This is one way to see that PSPACE ⊆ EXPTIME, since an alternating Turing machine is at least
EXPTIME
Model of computation in computer science
machines and nondeterministic Turing machines. An unambiguous Turing machine is defined as a nondeterministic Turing machine with the property that for every
Unambiguous_Turing_machine
Class in computational complexity theory
. Similarly, NC is equivalent to the problems solvable on an alternating Turing machine restricted to at most two options at each step with O(log n) space
NC_(complexity)
Hypothetical computational model
Zeno machines (abbreviated ZM, and also called accelerated Turing machine, ATM) are a hypothetical computational model related to Turing machines that
Zeno_machine
Topics referred to by the same term
A Turing machine is an abstract mathematical computational device named after Alan Turing; see the box for variants of this meaning. Turing machine may
Turing machine (disambiguation)
Turing_machine_(disambiguation)
time on an alternating Turing machine with a bounded number of alternations. It is a particular case of a bounded alternating Turing machine hierarchy
LH_(complexity)
A multitrack Turing machine is a specific type of multi-tape Turing machine. In a standard n-tape Turing machine, n heads move independently along n tracks
Multi-track_Turing_machine
A symmetric Turing machine is a Turing machine that has a configuration graph that is undirected (that is, configuration i yields configuration j if and
Symmetric_Turing_machine
solved by an alternating Turing machine in exponential space. This is one way to see that EXPSPACE ⊆ 2-EXPTIME, since an alternating Turing machine is at least
2-EXPTIME
Mathematical model of abstract computation
2-state 5-symbol Turing machine, and conjectured that a particular 2-state 3-symbol Turing machine (hereinafter (2,3) Turing machine) might be universal
Wolfram's 2-state 3-symbol Turing machine
Wolfram's_2-state_3-symbol_Turing_machine
Hypothesis in computational complexity theory
sequential space; compare Turing machine, non-deterministic Turing machine, and alternating Turing machine. N. Blum (1983) introduced a model for which the thesis
Parallel_computation_thesis
Inherent difficulty of computational problems
machines, non-deterministic Turing machines, quantum Turing machines, symmetric Turing machines and alternating Turing machines. They are all equally powerful
Computational complexity theory
Computational_complexity_theory
Class of computational complexity
characterization of PSPACE is the set of problems decidable by an alternating Turing machine in polynomial time, sometimes called APTIME or just AP. A logical
PSPACE
languages computable on an alternating Turing machine in time 2 c n {\displaystyle 2^{cn}} for some c with constantly many alternations. EXPH is the union of
Exponential_hierarchy
Memory space for a deterministic Turing machine
resource describing the resource of memory space for a deterministic Turing machine. It represents the total amount of memory space that a "normal" physical
DSPACE
Digital circuit that produces sums from inputs
1 ) ⋅ D {\displaystyle 3D+(n-1)\cdot 2D=(2n+1)\cdot D} A design with alternating carry polarities and optimized AND-OR-Invert gates can be about twice
Adder_(electronics)
Branch of computational complexity theory
nondeterministic Turing machine. The machine may be specified by one of any of the standard formulations. One usually considers the one-tape Turing machine, but the
Parameterized_complexity
Mathematical model of computation
order. The finite-state machine has less computational power than some other models of computation such as the Turing machine. The computational power
Finite-state_machine
Topics referred to by the same term
fonts Accelerated Turing machine or Zeno machine, a model of computation used in theoretical computer science Alternating Turing machine, a model of computation
ATM_(disambiguation)
Problems with central processing unit design
automaton Turing machine Alternating Turing machine Universal Post–Turing Quantum Nondeterministic Turing machine Probabilistic Turing machine Hypercomputation
Hazard (computer architecture)
Hazard_(computer_architecture)
Exponential function of an exponential function
equivalent to AEXPSPACE, the set of decision problems solvable by an alternating Turing machine in exponential space, and is a superset of EXPSPACE. An example
Double_exponential_function
Computer component
Technology Journal. 10 (3): 179–192. Advanced Micro Devices. AMD Secure Virtual Machine Architecture Reference Manual. Advanced Micro Devices, 2008. G. Neiger;
Translation_lookaside_buffer
Type of automaton
about what can be computed by machines. They are more capable than finite-state machines but less capable than Turing machines (see below). Deterministic
Pushdown_automaton
Proof by Alan Turing
Turing's proof is a proof by Alan Turing, first published in November 1936 with the title "On Computable Numbers, with an Application to the Entscheidungsproblem"
Turing's_proof
Security-related instruction code processor extension
signed by Intel. The attacker can then masquerade as legitimate Intel machines by signing arbitrary SGX attestation quotes. A security advisory and mitigation
Software_Guard_Extensions
Method of CPU communication
barriers in older generations of computers. Designers rarely expected machines to grow to make full use of an architecture's theoretical RAM capacity
Memory-mapped I/O and port-mapped I/O
Memory-mapped_I/O_and_port-mapped_I/O
Deterministic time, in computational complexity theory
the computational resource of computation time for a deterministic Turing machine. It represents the amount of time (or number of computation steps) that
DTIME
Type of digital adder
automaton Turing machine Alternating Turing machine Universal Post–Turing Quantum Nondeterministic Turing machine Probabilistic Turing machine Hypercomputation
Carry-save_adder
Computer hardware technology
automaton Turing machine Alternating Turing machine Universal Post–Turing Quantum Nondeterministic Turing machine Probabilistic Turing machine Hypercomputation
Trusted_Execution_Technology
Combinational digital circuit
different ALU operations. Generally, an ALU opcode is not the same as a machine language instruction, though in some cases it may be directly encoded as
Arithmetic_logic_unit
Turing machine Deterministic Turing machine Non-deterministic Turing machine Alternating automaton Alternating Turing machine Turing-complete Turing tarpit
List of computability and complexity topics
List_of_computability_and_complexity_topics
standing for "alternating" and referring both to the alternation between the AND and OR gates in the circuits and to alternating Turing machines. The smallest
AC_(complexity)
Turing machine or two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and
Read-only_Turing_machine
Register in a computer's CPU
automaton Turing machine Alternating Turing machine Universal Post–Turing Quantum Nondeterministic Turing machine Probabilistic Turing machine Hypercomputation
Memory_buffer_register
automaton Turing machine Alternating Turing machine Universal Post–Turing Quantum Nondeterministic Turing machine Probabilistic Turing machine Hypercomputation
Redundant binary representation
Redundant_binary_representation
Computational Formula that can be measured in terms of True or False
solved using an alternating Turing machine in linear time, since AP = PSPACE, where AP is the class of problems alternating machines can solve in polynomial
True quantified Boolean formula
True_quantified_Boolean_formula
Class of problems solvable in polynomial time
= AL, the set of problems solvable in logarithmic memory by alternating Turing machines. P is also known to be no larger than PSPACE, the class of problems
P_(complexity)
Memory space for a non-deterministic Turing machine
with alternating Turing machines. NSPACE is the non-deterministic counterpart of DSPACE, the class of memory space on a deterministic Turing machine. First
NSPACE
Circuit that performs subtraction
{X}}Y+YB_{in}} Adder (electronics) Carry-lookahead adder Carry-save adder Adding machine Adder-subtractor Foundations Of Digital Electronics by Elijah Mwangi Beltran
Subtractor
Hardware cache of a central processing unit
as a cache for accesses to the in-memory page table. Both machines predated the first machine with a cache for main memory, the IBM System/360 Model 85
CPU_cache
Powered mechanical device
computers are termed State machine and Turing machine. The biological molecule myosin reacts to ATP and ADP to alternately engage with an actin filament
Machine
complexity class AH The arithmetic hierarchy AP The class of problems alternating Turing machines can solve in polynomial time. APX Optimization problems that
List_of_complexity_classes
Closure of nondeterministic space under complementation
e. the languages decided by an alternating Turing machine in logarithmic space with a bounded number of alternations, is the same class as NL. Savitch's
Immerman–Szelepcsényi_theorem
Numbers that arise in the theory of Turing machines
Alan Turing's proof of the undecidability of the halting problem, and are very useful in reasoning about Turing machines as well. Say we had a Turing machine
Description_number
Impact of English computer scientist
Institute Turing Lecture Turing machine Turing patterns Turing reduction Turing test Turing Award Various institutions have paid tribute to Turing by naming
Legacy_of_Alan_Turing
Topics referred to by the same term
call) in Unix ATIME(f(n)) is the class of problems solvable by an alternating Turing machine in time f(n) This disambiguation page lists articles associated
Atime
Complexity class
{DSPACE}}(t(n))} . A generalization of NTIME is ATIME, defined with alternating Turing machines. It turns out that N T I M E ( t ( n ) ) ⊆ A T I M E ( t ( n
NTIME
Study of computable functions and Turing degrees
(Turing) computable, or recursive function if there is a Turing machine that, on input n, halts and returns output f(n). The use of Turing machines here
Computability_theory
Theorem in computability theory
Given a set A {\displaystyle A} , the Turing jump A ′ {\displaystyle A'} is the set of indices of oracle Turing machines that halt on input 0 {\displaystyle
Post's_theorem
British-Canadian computer scientist (born 1947)
on to win the ACM A.M. Turing Award in 2018. All three Turing winners continue to be members of the CIFAR Learning in Machines & Brains program. Hinton
Geoffrey_Hinton
Study of abstract machines and automata
different names by different research communities. The earlier concept of Turing machine was also included in the discipline along with new forms of infinite-state
Automata_theory
Set of problems in computational complexity theory
Turing machine so that it is possible for the machine to store the entire input (it can be shown that in terms of computability the two-tape Turing machine
Complexity_class
Class of problems in computer science
only deterministic Turing machines. A language L is in PP if and only if there exists a polynomial p and deterministic Turing machine M, such that M runs
PP_(complexity)
American computer scientist
science". Chandra & Stockmeyer (1976) — this work introduced alternating Turing machines. Dwork, Lynch & Stockmeyer (1988) — this paper received the Dijkstra
Larry_Stockmeyer
2019 novel by Ian McEwan
alternative history timeline in which the UK lost the Falklands War, Alan Turing is still alive, and the Internet, social media, and self-driving cars already
Machines_Like_Me
on the tape as a string of Turing 5-tuples, hence its universality. While the classical UTM model expects to find Turing 5-tuples on its tape, any program-set
Random-access stored-program machine
Random-access_stored-program_machine
Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
problem in NP can be reduced in polynomial time by a deterministic Turing machine to the Boolean satisfiability problem. The theorem is named after Stephen
Cook–Levin_theorem
1952 puzzle video game
by Alan Turing starting in 1945. The project was delayed for many months, however, due to technical, political, and economic reasons, and Turing abandoned
Checkers_(video_game)
Higher level of microcode
set of a computer. The instruction set for millicode is a subset of the machine's native instruction set, omitting those instructions that are implemented
Millicode
Test of machine intelligence
of the Turing test. Proposed by Alan Turing in 1950, the Turing test plays a central role in the philosophy of artificial intelligence. Turing proposed
Winograd_schema_challenge
Real number that can be computed within arbitrary precision
between 0 and 1: A computable number [is] one for which there is a Turing machine which, given n on its initial tape, terminates with the nth digit of
Computable_number
complexity class of problems that can be solved by a non-deterministic Turing machine using only a logarithmic amount of memory is called NL. The st-connectivity
St-connectivity
Hierarchy of complexity classes for formulas defining sets
by some Turing machines T1 and T2, respectively. For every number n, exactly one of these halts. We may therefore construct a Turing machine T that alternates
Arithmetical_hierarchy
Type of finite automaton in automata theory
the machine will move its position in the input to the left, right, or stay at the same position. Equivalently, 2DFAs can be seen as read-only Turing machines
Two-way_finite_automaton
Early British cryptanalysis computer
Alan Turing's use of probability in cryptanalysis (see Banburismus) contributed to its design. It has sometimes been erroneously stated that Turing designed
Colossus_computer
1872 utopian novel by Samuel Butler
Spell of Plato. Vol. 1, (Princeton University Press) 1971. Turing, Sara (2012). Alan M. Turing: Centenary Edition. Cambridge University Press. p. 157. ISBN 978-1107020580
Erewhon
Turing is a stream cipher developed by Gregory G. Rose and Philip Hawkes at Qualcomm for CDMA. Turing generates 160 bits of output in each round by applying
Turing_(cipher)
Philosophical position
theoretical "machines" or computers capable of computing any given algorithm which were developed by Alan Turing (called Turing machines). Putnam himself
Functionalism (philosophy of mind)
Functionalism_(philosophy_of_mind)
theoretical computer science. Among other contributions, he introduced alternating Turing machines in computational complexity (with Dexter Kozen and Larry Stockmeyer)
Ashok_K._Chandra
Authenticated encryption with associated data algorithm
SEAL SNOW SOBER SOBER-128 Spritz Turing VEST VMPC WAKE Generators shrinking generator self-shrinking generator alternating step generator Theory block ciphers
ChaCha20-Poly1305
Hypothetical consciousness in artificial systems
for testing machine intelligence is the Turing test, which assesses the ability to have a human-like conversation. But passing the Turing test does not
Artificial_consciousness
Proof technique in computational complexity theory
is also sometimes used for space complexity classes, alternating classes, and bounded alternating classes. Theorem. If P = NP then EXP = NEXP. Proof. E
Padding_argument
2013 science fiction film directed by Caradog W. James
Infinity Chamber List of artificial intelligence films Sally–Anne test Turing test Siegel, Tatiana (6 March 2013). "Tribeca 2013: Paul Rudd, Paul Giamatti
The_Machine_(2013_film)
Computer science field
temporal logic specification was done by Amir Pnueli, who received the 1996 Turing award for "seminal work introducing temporal logic into computing science"
Model_checking
Concept in computational complexity theory
set of decision problems that can be solved by a non-deterministic Turing machine using time 2 n O ( 1 ) {\displaystyle 2^{n^{O(1)}}} . In terms of NTIME
NEXPTIME
Physical components of a computer
In 1936, Alan Turing developed the concept of the universal Turing machine to model any type of computer, demonstrating that no machine could solve the
Computer_hardware
Complexity class of bounded-depth circuits
addition of the BIT predicate, or alternatively by FO(+, ×), or by Turing machine in the logarithmic hierarchy. In 1984 Furst, Saxe, and Sipser showed
AC0
AI whose outputs can be understood by humans
explainable AI (XAI), generally overlapping with interpretable AI or explainable machine learning (XML), is a field of research that explores methods that provide
Explainable artificial intelligence
Explainable_artificial_intelligence
Stream cipher
the Wayback Machine (archived 21 February 2015) RSA Security Response to Weaknesses in Key Scheduling Algorithm of RC4 at the Wayback Machine (archived
RC4
Type of symmetric key cipher
include the stop-and-go generator, the alternating step generator and the shrinking generator. An alternating step generator comprises three LFSRs, which
Stream_cipher
American philosopher and artificial intelligence expert
faults that plague the Turing test. Chip Test: The Chip test, unlike the Turing test Focuses on the parts inside the machine and not just its behaviors
Susan_Schneider
American artificial intelligence company
July 27, 2025. "Humans triumph over AI at annual math Olympiad, but the machines are catching up - CBS News". www.cbsnews.com. CBS/AFP. July 22, 2025. Retrieved
OpenAI
Model of computation
single circuit (in contrast to the Turing machine model, in which a language is fully described by a single Turing machine). A language is instead represented
Boolean_circuit
Type of finite-state machine in automata theory
nondeterministic finite automaton Pushdown automaton Nondeterministic Turing machine Martin, John (2010). Introduction to Languages and the Theory of Computation
Nondeterministic finite automaton
Nondeterministic_finite_automaton
Form of pseudorandom number generator
In cryptography, an alternating step generator (ASG) is a cryptographic pseudorandom number generator used in stream ciphers, based on three linear-feedback
Alternating_step_generator
Stream ciphers
SSE implementation optimization discovered for Salsa20. Rather than alternating rounds down columns and across rows, they are performed down columns
Salsa20
ALTERNATING TURING-MACHINE
ALTERNATING TURING-MACHINE
Female
English
Elaborated form of English Tara, TARINA means "hill."
Male
Welsh
Welsh name derived from the element aur, EURIG means "gold."
Boy/Male
Hindu, Indian, Tamil
Cool; Alternative of Vimal
Boy/Male
Muslim
Loving, Caring, Daring
Girl/Female
Indian
Lively, Entertainer, From a stream or a Spring, The Spring season, The Spring season
Surname or Lastname
English
English : habitational name from places in Oxfordshire and West Sussex named Goring, from Old English GÄringas ‘people of GÄra’, a short form of the various compound names with the first element gÄr ‘spear’.German (Göring) : see Goering.
Surname or Lastname
English
English : variant of Darling.
Surname or Lastname
English
English : of uncertain origin. Early examples, as for example William Spring (Yorkshire 1280), all point to a personal name or nickname, perhaps going back to an Old English byname derived from the verb springan ‘to jump or leap’ (see Springer 1). Alternatively, it could be a topographic name from Middle English spring ‘young wood’, ‘spring’. Compare Springer. Reaney derives the surname from the word denoting the season, although the word is not attested in this sense until the 16th century, the usual Middle English word being lenten. Compare Lenz. The surname has also been established in Ireland (County Kerry) for several centuries.German : from Middle High German sprinc, Middle Low German sprink ‘spring’, ‘well’, hence a topographic name for someone who lived by a spring or well, or habitational name from Springe near Hannover.Jewish (Ashkenazic) : variant of Springer.John Spring emigrated from England and settled in Watertown, MA, in 1634.
Surname or Lastname
English (Kent)
English (Kent) : unexplained.Possibly an altered spelling of the German surname Dulling, which is likewise unexplained.
Girl/Female
American, Australian, Bengali, British, Christian, English, Indian
Springtime; Spring Season; Rapid Movement
Boy/Male
Muslim/Islamic
Loving Caring, Daring
Boy/Male
Hindu, Indian
A Thought
Boy/Male
Arabic, Australian, German
Alternative of God
Boy/Male
Indian
Loving, Caring, Daring
Surname or Lastname
English
English : perhaps be a nickname from Middle English daring ‘trembling’, ‘crouching or transfixed with fear’.
Surname or Lastname
English
English : ethnic name from Old French Lohereng ‘man from Lorraine’ (see Lorraine).
Female
English
English name derived from the season name, "spring," (Mar. 21 thru Jun. 21), derived from the verb spring, "to burst forth," from Proto-Indo-European *sprengh-, SPRING means "rapid movement."Â
Surname or Lastname
English
English : from a pet form of the personal name Hugh.
Surname or Lastname
English and French
English and French : from an Anglo-Norman French form of the Old Norse personal name þórfinnr, composed of the elements þórr, the name of the god of thunder in Scandinavian mythology (see Thor) + the ethnic name Finnr ‘Finn’. This may have absorbed another name, Turpius, Turpinus (from Latin turpis ‘ugly’, ‘base’), one of the self-abasing names adopted as a mark of humility by the early Christians. It was borne by the archbishop of Rheims in the Charlemagne legend.A Turpin of unknown geographic origin is documented in Montreal in 1681.
Surname or Lastname
German and Jewish (Ashkenazic)
German and Jewish (Ashkenazic) : from Middle High German hærinc ‘herring’, German Hering, a nickname for someone supposedly resembling a herring or a metonymic occupational name for a fish seller. In some cases the Jewish surname is ornamental.English : variant spelling of Herring.
ALTERNATING TURING-MACHINE
ALTERNATING TURING-MACHINE
Boy/Male
Indian
With Lots of Love
Boy/Male
Christian & English(British/American/Australian)
Powerful Ruler
Girl/Female
Tamil
Sanmathi | ஸஂமாஂதீ
Boy/Male
Indian, Punjabi, Sikh
Peace Giving Divine Knowledge
Male
Italian
Italian form of Latin Reginaldus, RINALDO means "wise ruler."
Boy/Male
Indian, Punjabi, Sikh
Gem of Truth
Boy/Male
Tamil
King of all Era
Boy/Male
Arabic, Muslim, Sindhi
Two Garments
Girl/Female
Hindu
Apsara
Boy/Male
Hindu, Indian, Sanskrit
Lord Shiva
ALTERNATING TURING-MACHINE
ALTERNATING TURING-MACHINE
ALTERNATING TURING-MACHINE
ALTERNATING TURING-MACHINE
ALTERNATING TURING-MACHINE
n.
An exposure to air, or to a fire, for warming, drying, etc.; as, the airing of linen, or of a room.
a.
Consuming; intense; inflaming; exciting; vehement; powerful; as, burning zeal.
n.
A line for hauling the reef cringle to the yard; -- also called reef earing.
a.
Bold; fearless; adventurous; as, daring spirits.
n.
A series of tubes; tubes, collectively; a length or piece of a tube; material for tubes; as, leather tubing.
n.
The pieces, or chips, detached in the process of turning from the material turned.
n.
The chips or fragments made by boring.
n.
A tiring-room.
n.
Alt. of Goring cloth
n.
Boldness; fearlessness; adventurousness; also, a daring act.
n.
Alternateness; alternation.
n.
A line used to fasten the upper corners of a sail to the yard or gaff; -- also called head earing.
n.
The act or state of that which curls; as, the curling of smoke when it rises; the curling of a ringlet; also, the act or process of one who curls something, as hair, or the brim of hats.
n.
The act or process of one who, or that which, bores; as, the boring of cannon; the boring of piles and ship timbers by certain marine mollusks.
a.
Disjunctive; as, an alternative conjunction.
n.
A hole made by boring.
n.
An obscure road; a way turning from the main road.
n.
The reciprocal succession of things in time or place; the act of following and being followed by turns; alternate succession, performance, or occurrence; as, the alternation of day and night, cold and heat, summer and winter, hope and fear.
prep.
In the time of; as long as the action or existence of; as, during life; during the space of a year.