AI & ChatGPT searches , social queries for TURING TABLES
Search references for TURING TABLES. Phrases containing TURING TABLES
See searches and references containing TURING TABLES!
Search references for TURING TABLES. Phrases containing TURING TABLES
See searches and references containing TURING TABLES!TURING TABLES
Topics referred to by the same term
Turing tables may refer to: Tables of specifications for each instruction in a Turing machine A misspelling of the song "Turning Tables", by Adele A misspelling
Turing_tables
Computation model defining an abstract machine
machine). It was Turing's doctoral advisor, Alonzo Church, who later coined the term "Turing machine" in a review. With this model, Turing was able to answer
Turing_machine
2011 single by Adele
was sent for airplay to Italian radio stations. "Turning Tables" A sample of "Turning Tables," whose chorus consists of the lyrics "So I won't let you
Turning_Tables
Ability of a computing system to simulate Turing machines
cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine (devised by English mathematician
Turing_completeness
Thesis on the nature of computability
computable by a Turing machine. The thesis is named after American mathematician Alonzo Church and the British mathematician Alan Turing. Before the precise
Church–Turing_thesis
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
Abstract calculator
Post machine or Post–Turing machine is a "program formulation" of a type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of
Post–Turing_machine
List
Turing OS Turing pattern Turing Pharmaceuticals Turing (programming language) Turing reduction Turing Robot, China Turing scheme Turing table Turing tarpit
List of things named after Alan Turing
List_of_things_named_after_Alan_Turing
are examples to supplement the article Turing machine. The following table is Turing's very first example (Turing 1937): "1. A machine can be constructed
Turing_machine_examples
Concept in computability theory
{\displaystyle B\leq _{T}A.} The equivalence classes of Turing equivalent sets are called Turing degrees. The Turing degree of a set X {\displaystyle X} is written
Turing_reduction
Concept in theoretical computer science
programs used in the game are n-state Turing machines, one of the first mathematical models of computation. Turing machines consist of an infinite tape
Busy_beaver
Proof by Alan Turing
Turing's proof is a proof by Alan Turing submitted on 12 November 1936 and first published in 1937 with the title "On Computable Numbers, with an Application
Turing's_proof
Codebreaking device created at Bletchley Park (United Kingdom)
re-opening on 23 June 2018. Virtual Bombe - Online 3D simulation of a Turing-Welchman Bombe Turing Bombe and US Navy Bombe simulator Cryptanalysis of the Enigma
Bombe
Models of computation
Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For example
Hypercomputation
Concept in theoretical computer science
every Turing reduction between sets can be performed by a truth-table reduction, but every truth-table reduction can be performed by a Turing reduction
Truth-table_reduction
Attempts to formalize the concept of algorithms
functions calculated by a person with paper and pencil, and (2) the Turing machine or its Turing equivalents—the primitive register-machine or "counter-machine"
Algorithm_characterizations
Study of computable functions and Turing degrees
Church, Rózsa Péter, Alan Turing, Stephen Kleene, and Emil Post. The fundamental results the researchers obtained established Turing computability as the correct
Computability_theory
Problem in computer science
problem considered in Turing's 1936 paper ("does a Turing machine starting from a blank tape ever print a given symbol?"). However, Turing equivalence is rather
Halting_problem
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
Thought experiment on artificial intelligence
understanding the argument, including symbol processing, Turing machines, Turing completeness, and the Turing test. Searle's arguments are not usually considered
Chinese_room
Sequence of operations for a task
size of inputs increase. Any algorithm can be computed by any Turing complete model. Turing completeness only requires four instruction types—conditional
Algorithm
First electronic general-purpose digital computer
of these features, but ENIAC was the first to have them all. ENIAC was Turing-complete and able to solve "a large class of numerical problems" through
ENIAC
Person performing mathematical calculations, before electronic calculators
mathematical calculations, before electronic calculators became available. Alan Turing described the "human computer" as someone who is "supposed to be following
Computer_(occupation)
Mathematical model of abstract computation
universal 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
Mathematical model of computation
computation such as the Turing machine. The computational power distinction means there are computational tasks that a Turing machine can do but an FSM
Finite-state_machine
Type of AI with wide-ranging abilities
meant to confirm human-level AGI have been considered. The Turing test was proposed by Alan Turing in his 1950 paper "Computing Machinery and Intelligence"
Artificial general intelligence
Artificial_general_intelligence
Free school in Twickenham, Greater London, England
schools in the south and south-west of England. Turing House School is named in honour of Alan Turing, the famous mathematician who lived for a while
Turing_House_School
Mathematical table used in logic
table which can assist the reader in grasping the rules more quickly. Truth tables are also used to specify the function of hardware look-up tables (LUTs)
Truth_table
Method of comparing problems by transforming one into another in computability theory
reducibility relation. For example, the Turing degrees are the equivalence classes of sets of naturals induced by Turing reducibility. The degrees of any reducibility
Reduction (computability theory)
Reduction_(computability_theory)
Intelligence of machines
8–17), Moravec (1988, p. 3) Turing's original publication of the Turing test in "Computing machinery and intelligence": Turing (1950) Historical influence
Artificial_intelligence
Algorithmic runtime requirements for common math procedures
refers to the time complexity of performing computations on a multitape Turing machine. See big O notation for an explanation of the notation used. Note:
Computational complexity of mathematical operations
Computational_complexity_of_mathematical_operations
Method for solving one problem using another
restrictive, are polynomial-time many-one reductions, truth-table reductions, and Turing reductions. The most frequently used of these are the many-one
Polynomial-time_reduction
Programmable machine that processes data
of the modern computer was proposed by Alan Turing in his seminal 1936 paper, On Computable Numbers. Turing proposed a simple device that he called "Universal
Computer
Parallel computing platform and programming model
"Dissecting the NVidia Turing T4 GPU via Microbenchmarking". arXiv:1903.07486 [cs.DC]. Burgess, John (2019). "RTX ON – The NVIDIA TURING GPU". 2019 IEEE Hot
CUDA
Mathematical function that can be computed by a program
models of computation, including Turing machines General recursive functions Lambda calculus Post machines (Post–Turing machines and tag machines). Register
Computable_function
read-only Turing machine or two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing machine
Read-only_Turing_machine
Concept in computer science
available. The reversible Turing machine (RTM) is a foundational model in reversible computing. An RTM is defined as a Turing machine whose transition
Reversible_computing
Two-dimensional cellular automaton
universal Turing machine, so the Game of Life is theoretically as powerful as any computer with unlimited memory and no time constraints; it is Turing complete
Conway's_Game_of_Life
Complexity class used to classify decision problems
deterministic Turing machine, or alternatively the set of problems that can be solved in polynomial time by a nondeterministic Turing machine. NP is
NP_(complexity)
1948 chess program
Turing and Champernowne, as its algorithm was too complex to be run by the early computers of the time such as the Automatic Computing Engine. Turing
Turochamp
Unsolved problem in computer science
deterministic polynomial-time Turing machine. Meaning, P = { L : L = L ( M ) for some deterministic polynomial-time Turing machine M } {\displaystyle
P_versus_NP_problem
Generative AI chatbot by OpenAI
Nature article that "ChatGPT broke the Turing test". Stanford researchers reported that GPT-4 "passes a rigorous Turing test, diverging from average human
ChatGPT
Type of abstract computing machine
generic class of abstract machines, analogous to a Turing machine and thus Turing complete. Unlike a Turing machine that uses a tape and head, a register machine
Register_machine
Book by Charles Petzold
Everything a Turing Machine? Chapter 18: The Long Sleep of Diophantus Alan Turing: The Enigma (1983) Prof: Alan Turing Decoded (2015) The Turing Guide (2017)
The_Annotated_Turing
1989 book by Roger Penrose
Wikiquote has quotations related to The Emperor's New Mind. Alan Turing Anathem Church–Turing thesis Mind–body dualism Orchestrated objective reduction Quantum
The_Emperor's_New_Mind
Ability to solve a problem by an effective procedure
computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the
Computability
Impossible task in computing
computable by a Turing machine (or equivalently, by those expressible in the lambda calculus). This assumption is now known as the Church–Turing thesis. The
Entscheidungsproblem
Measure of algorithmic complexity
encoding for Turing machines, where an encoding is a function which associates to each Turing Machine M a bitstring <M>. If M is a Turing Machine which
Kolmogorov_complexity
Cryptanalytic process developed by Alan Turing during World War II
Banburismus was a cryptanalytic process developed by Alan Turing at Bletchley Park in Britain during the Second World War. It was used by Bletchley Park's
Banburismus
Finite-state machine
eliminating isomorphic automata. Read-only right-moving Turing machines are a particular type of Turing machine that only moves right; these are almost exactly
Deterministic finite automaton
Deterministic_finite_automaton
British statistician and cryptographer (1916–2009)
cryptologist at Bletchley Park with Alan Turing. After the Second World War, Good continued to work with Turing on the design of computers and Bayesian
I._J._Good
Mathematical logic concept
computable. According to the Church–Turing thesis, any effectively calculable function is calculable by a Turing machine, and thus a set S is computably
Computably_enumerable_set
Computer architecture where code and data share a common bus
that the fundamental conception is owing to Turing—in so far as not anticipated by Babbage.... Both Turing and von Neumann, of course, also made substantial
Von_Neumann_architecture
Academy in St Albans, Hertfordshire, England
2022–2023, a new house was introduced, called Turing, named after the mathematician and computer scientist Alan Turing. Consequently, the letter "T" was added
Beaumont_School,_St_Albans
Mathematical-logic system based on functions
N]. Lambda calculus is Turing complete, that is, it is a universal model of computation that can be used to simulate any Turing machine. Its namesake,
Lambda_calculus
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
Turing machine on a two-dimensional grid
one-dimensional Turing machines with an infinite tape, as either can simulate the other. Langton's ants were invented in 1986 and declared "equivalent to Turing machines"
Turmite
Film directed by Michael Apted
Sale Retrieved 25 November 2017 Update to Alan Turing: the Enigma by Andrew Hodges Part 5: Running Up, Turing.org Retrieved 25 November 2017 The Documents
Enigma_(2001_film)
Free and open-source object relational database management system
languages Tables can be set to inherit their characteristics from a parent table. Data in child tables will appear to exist in the parent tables, unless
PostgreSQL
Matthew Quick Nominated 2014 Graham Moore The Imitation Game The book Alan Turing: The Enigma by Andrew Hodges Won 2017 Aaron Sorkin Molly's Game The book
List of Jewish Academy Award winners and nominees
List_of_Jewish_Academy_Award_winners_and_nominees
Country in West Africa
region. The French responded to Ture's expansion and conquest with military pressure. French campaigns against Ture, which were met with fierce resistance
Ivory_Coast
Limitative results in mathematical logic
debate centers on whether the human mind is equivalent to a Turing machine, or by the Church–Turing thesis, any finite machine at all. If it is, and if the
Gödel's incompleteness theorems
Gödel's_incompleteness_theorems
Decryption of World War II cipher
keyboard, Alan Turing reviewed decrypted messages and determined that the word eins ("one") appeared in 90% of messages.[citation needed] Turing automated
Cryptanalysis_of_the_Enigma
Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
polynomial time by a deterministic Turing machine. (The statements verifiable in polynomial time by a deterministic Turing machine and solvable in polynomial
Cook–Levin_theorem
Public research university in Zurich
Albert Einstein, two Fields Medalists, three Pritzker Prize winners, and one Turing Award recipient. It is a founding member of the IDEA League and the International
ETH_Zurich
Type of computer
computer can be traced back to the 1936 theoretical concept of a universal Turing machine. Von Neumann was aware of this paper, and he impressed it on his
Stored-program_computer
described by computer scientist Alan Turing, who set out the idea in his seminal 1936 paper, On Computable Numbers. Turing reformulated Kurt Gödel's 1931 results
History_of_computing_hardware
Computer hardware technology that uses quantum mechanics
the braiding of anyons in a 2D lattice. A quantum Turing machine is the quantum analog of a Turing machine. All of these models of computation—quantum
Quantum_computing
Battery electric mid-size crossover SUV
first application of its self-developed Turing AI chips capable of 750 TOPS each for a total of 2,250 TOPS. The Turing AI chips are also responsible for running
XPeng_G7
Real number that can be computed within arbitrary precision
Gödel numbers correspond to Turing machines that produce computable reals. In order to produce a computable real, a Turing machine must compute a total
Computable_number
Spreadsheet editor by Microsoft
(using pivot tables and the scenario manager). A PivotTable is a tool for data analysis. It does this by simplifying large data sets via PivotTable fields.
Microsoft_Excel
Software system for statistical models
and robotics tasks. More recently, the probabilistic programming system Turing.jl has been applied in various pharmaceutical and economics applications
Probabilistic_programming
Estimate of time taken for running an algorithm
deterministic Turing machine in polynomial time NP: The complexity class of decision problems that can be solved on a non-deterministic Turing machine in
Time_complexity
Brand of Nvidia graphics cards used in workstations
Pascal, Volta, Turing, Ampere, Ada Lovelace) CUDA SDK 12.0 support for Compute Capability 5.0 – 8.9 (Maxwell, Pascal, Volta, Turing, Ampere, Ada Lovelace)
Quadro
Set of problems in computational complexity theory
"Other models of computation"), the Turing machine is used to define most basic complexity classes. With the Turing machine, instead of using standard
Complexity_class
in Technology International Hall of Fame inductees Timeline of computing Turing Award Women in computing Mario Tokoro, ed. (2010). "9". e: From Understanding
List of pioneers in computer science
List_of_pioneers_in_computer_science
Academy in Stoke-on-Trent, Staffordshire, England
URN 142186 Tables Ofsted Reports Principal Claire Stanyer Gender Co-educational Age 11 to 16 Houses Yousafzai, Bridgewater, Grangewood, Turing Website
Ormiston_Meridian_Academy
Logical connective AND
set of operands) is often defined as having the result true. The truth table of A ∧ B {\displaystyle A\land B} : In systems where logical conjunction
Logical_conjunction
Programming language that uses first order logic
Horn clauses, which is Turing-complete. Turing completeness of Prolog can be shown by using it to simulate a Turing machine: turing(Tape0, Tape) :- perform(q0
Prolog
AI research laboratory
DeepMind introduced neural Turing machines (neural networks that can access external memory like a conventional Turing machine). The company has created
Google_DeepMind
Academy in Milton Keynes, England
Colossus (silver) and Turing (gold), whose names relate to World War II code-breaking work at Bletchley Park. Previously Turing house was called Ultra
Lord_Grey_Academy
Type of automaton
power to a Turing machine. A linear bounded automaton is a device which is more powerful than a pushdown automaton but less so than a Turing machine. A
Pushdown_automaton
Hierarchy of classes of formal grammars
enumerable or Turing-recognizable languages. Note that this is different from the recursive languages, which can be decided by an always-halting Turing machine
Chomsky_hierarchy
Basic United States Marine Corps doctrine
Marine Corps rifle training data book, given to recruits when undertaking Table 1 of rifle qualification, the Rifleman's Creed is printed within the data
Rifleman's_Creed
Boarding school and free school in Holyport, Berkshire, England
Education URN 139971 Tables Ofsted Reports Head Alastair Ingall Gender Mixed Age 11 to 19 Enrolment 600 Capacity 600 Houses Brunel, Turing, Johnson and Fawcett
Holyport_College
American cryptographer (born 1947)
of the inventors of the RSA algorithm, for which they won the 2002 ACM Turing Award. He is also the inventor of the symmetric key encryption algorithms
Ron_Rivest
could be described "purely mechanical." The theoretical Turing Machine, created by Alan Turing, is a hypothetical device theorized in order to study the
History_of_computer_science
versions are not included. Please do not edit the tables to match your specific AIB model. The fields in the table listed below describe the following: Model
List of Nvidia graphics processing units
List_of_Nvidia_graphics_processing_units
British politician (born 1995)
legalise assisted suicide. He called for a rail line to be named after Alan Turing. He called for capping ticket prices and alcohol as part of football reform
Luke_Charters
Physical components of a computer
language similar to assembly language. In 1936, Alan Turing developed the concept of the universal Turing machine to model any type of computer, demonstrating
Computer_hardware
Academy in Eastbourne, East Sussex, England
September 2020 The Turing School converted to academy status. The school is now sponsored by the Swale Academies Trust. The Turing School building is
The_Turing_School
American computer scientist and mathematician (born 1938)
professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science. Knuth
Donald_Knuth
Encoding for a sequence of byte values using 32 printable characters
2020-04-03. "Alan M. Turing (1912 - 1954)". Computer 50. The University of Manchester. Retrieved 17 April 2025. "Alan M. Turing (1912 - 1954)". Digital
Base32
Academy in Madeley, Staffordshire, England
Gender Coeducational Age 11 to 16 Enrolment 650 Capacity 675 Houses Elizabeth, Bennet, Mitchell, Banks, Turing[citation needed] Website madeleyschool.org
Madeley_High_School
Secondary school in Worcester, England
five a side football pitch. The academy comprises five colleges: Angelou, Turing, Attenborough, Keller and Ashe. "Elgar Set for New Name". Worcester News
Tudor Grange Academy, Worcester
Tudor_Grange_Academy,_Worcester
Academy in Reigate, Surrey, England
Enrolment 1,262 (2020) Capacity 1,250 Houses Attenborough, Parks, Curie and Turing Colours Blue and yellow-gold Website www.reigate-school.surrey.sch.uk
Reigate_School
Public university in Chennai, India
"Poondi" Kumaraswamy, engineer, mathematician, and hydrologist Raj Reddy, Turing Award winner, professor at Carnegie-Mellon University and Padma Bhushan
Anna_University
Academy in Cheshunt, Hertfordshire, England
URN 138360 Tables Ofsted Reports Head Teacher Richard Vaughan Gender Mixed Age 11 to 19 Enrolment 1,011 as of March 2016[update] Houses Turing Franklin
St Mary's Church of England High School
St_Mary's_Church_of_England_High_School
Academy in Pill, Somerset, England
Education URN 142853 Tables Ofsted Reports Gender Co-educational Age 11 to 18 Houses Stephenson (Red), Pankhurst (Green), Turing (Blue), Yousafzai (Yellow)
St_Katherine's_School
Archaeological site in Iran
IA (Neolithic period - these layers are assumed to lie below the water table. From this horizon occur Djeitun-like sherds, incorporated in bricks made
Tureng_Tepe
TURING TABLES
TURING TABLES
Surname or Lastname
English
English : from a pet form of the personal name Hugh.
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.
Girl/Female
Indian
Lively, Entertainer, From a stream or a Spring, The Spring season, The Spring season
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
English
English : perhaps be a nickname from Middle English daring ‘trembling’, ‘crouching or transfixed with fear’.
Boy/Male
Hindu, Indian
A Thought
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.
Boy/Male
Muslim
Loving, Caring, Daring
Female
English
Elaborated form of English Tara, TARINA means "hill."
Girl/Female
American, Australian, Bengali, British, Christian, English, Indian
Springtime; Spring Season; Rapid Movement
Boy/Male
Muslim/Islamic
Loving Caring, Daring
Surname or Lastname
English (Kent)
English (Kent) : unexplained.Possibly an altered spelling of the German surname Dulling, which is likewise unexplained.
Male
Welsh
Welsh name derived from the element aur, EURIG means "gold."
Surname or Lastname
English
English : ethnic name from Old French Lohereng ‘man from Lorraine’ (see Lorraine).
Surname or Lastname
English
English : patronymic from Dear 1.German (Döring) : see Doering.
Surname or Lastname
English
English : variant of Darling.
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."Â
Boy/Male
Indian
Loving, Caring, Daring
Surname or Lastname
English
English : patronymic from Dear 1.German : probably a variant of Döring (see Doering).
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.
TURING TABLES
TURING TABLES
Boy/Male
Muslim
Ready
Boy/Male
Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi
Brilliant
Girl/Female
Australian, British, Chinese, English
White; Bird Name
Girl/Female
English, Modern
Blessing from God; Gift to God
Girl/Female
Muslim
Solitude
Boy/Male
Indian, Sikh
Strong
Boy/Male
Hindu
Best wishes, Offering to God
Male
English
Variant spelling of Middle English Aylward, ELWEARD means "elf guard" or "noble guard."
Biblical
who demands his death
Boy/Male
Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Sanskrit, Tamil, Telugu
Statue of Truth
TURING TABLES
TURING TABLES
TURING TABLES
TURING TABLES
TURING TABLES
n.
An instrument turning on a center, for boring holes. See Bit, n., 3.
n.
A variety of the domestic pigeon remarkable for its habit of tumbling, or turning somersaults, during its flight.
n.
Alt. of Goring cloth
n.
A line used to fasten the upper corners of a sail to the yard or gaff; -- also called head earing.
a.
Consuming; intense; inflaming; exciting; vehement; powerful; as, burning zeal.
n.
A hole made by boring.
n.
The chips or fragments made by boring.
n.
A series of tubes; tubes, collectively; a length or piece of a tube; material for tubes; as, leather tubing.
n.
An obscure road; a way turning from the main road.
a.
Bold; fearless; adventurous; as, daring spirits.
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.
A line for hauling the reef cringle to the yard; -- also called reef earing.
n.
An exposure to air, or to a fire, for warming, drying, etc.; as, the airing of linen, or of a room.
n.
Boldness; fearlessness; adventurousness; also, a daring act.
n.
A tiring-room.
n.
The pieces, or chips, detached in the process of turning from the material turned.
prep.
In the time of; as long as the action or existence of; as, during life; during the space of a year.
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.