AI & ChatGPT searches , social queriess for REVERSE TURING-TEST
Search references for REVERSE TURING-TEST. Phrases containing REVERSE TURING-TEST
See searches and references containing REVERSE TURING-TEST!
Search references for REVERSE TURING-TEST. Phrases containing REVERSE TURING-TEST
See searches and references containing REVERSE TURING-TEST!REVERSE TURING-TEST
Test of artificial intelligence
of the reverse Turing test is one in which the subjects attempt to appear to be a computer rather than a human. A formal reverse Turing test follows
Reverse_Turing_test
Test of a machine's ability to imitate human intelligence
The Turing test was designed by Alan Turing to assess a machine's ability to exhibit intelligent behaviour equivalent to that of a human by imitating
Turing_test
Test to determine whether a user is human
Turing test to tell Computers and Humans Apart) is a [...] Mayumi Takaya; Yusuke Tsuruta; Akihiro Yamamura (30 September 2013). "Reverse Turing Test using
CAPTCHA
List
Reverse Turing test Subject matter expert Turing test The Turing Test (novel) The Turing Test (video game) Visual Turing Test The Turing Trust Turing
List of things named after Alan Turing
List_of_things_named_after_Alan_Turing
Copenhagen
acceptable simulation." Cross later referred to this as a kind of Reverse Turing test. The Wizard of Oz method is very powerful. Originally, Kelley created
Wizard_of_Oz_experiment
English computer scientist (1912–1954)
algorithm and computation with the Turing machine, which can be considered a model of a general-purpose computer. Turing is widely considered to be the father
Alan_Turing
Probabilistic problem-solving algorithm
in his 2001 book Fooled by Randomness as a real instance of the reverse Turing test: a human can be declared unintelligent if their writing cannot be
Monte_Carlo_method
British design researcher (born 1942)
communication via CCTV. Cross later referred to this as a kind of Reverse Turing test; in interaction design this kind of study later became known as a
Nigel_Cross
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
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
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
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
Type of formal grammar
match, then the Turing machine accepts the word. If they don't, the Turing machine will go back to step 1. It is easy to see that this Turing machine will
Unrestricted_grammar
American artist working in digital media
that you are human?" MrMind has been administering The Blurring Test, a Reverse Turing test, since 1998. In 2007 she co-authored, with Nonny de la Peña,
Peggy_Weil
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
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
Abstract machine that uses only one instruction
Arithmetic-based Turing-complete machines use an arithmetic operation and a conditional jump. Like the two previous universal computers, this class is also Turing-complete
One-instruction_set_computer
histories are more commonly used in reference to Turing machines. The configuration of a single-tape Turing machine consists of the contents of the tape,
Computation_history
Human error of identifying a human as machine
classifying human intelligence as machine (or artificial) intelligence during Turing tests. For example, in the Loebner Prize during which a tester conducts a text
Confederate_effect
61. The Turing machine: Newquist 1994, p. 56 McCorduck 2004, pp. 63–64 Crevier 1993, pp. 22–24 Russell & Norvig 2021, p. 9 and see Turing 1936–1937
History of artificial intelligence
History_of_artificial_intelligence
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
Inherent difficulty of computational problems
deterministic Turing machines, probabilistic Turing machines, non-deterministic Turing machines, quantum Turing machines, symmetric Turing machines and
Computational complexity theory
Computational_complexity_theory
American financial investor and businessman (born 1983)
compounded drug. Shkreli founded Turing Pharmaceuticals in February 2015, after his departure from Retrophin. He launched Turing with three drugs in development
Martin_Shkreli
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
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
19th century proposed mechanical computer
and so the language as conceived would have been Turing-complete as later defined by Alan Turing. Three different types of punch cards were used: one
Analytical_engine
British-Canadian computer scientist (born 1947)
LeCun, with whom Hinton would go on to win the ACM A.M. Turing Award in 2018. All three Turing winners continue to be members of the CIFAR Learning in
Geoffrey_Hinton
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)
Sentence containing all letters of the English alphabet
because of this, the phrase is commonly used for touch-typing practice, testing typewriters and computer keyboards, displaying examples of fonts, and other
The quick brown fox jumps over the lazy dog
The_quick_brown_fox_jumps_over_the_lazy_dog
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
Primitive programming language created in 1964
programming language created by Corrado Böhm in 1964 to describe a family of Turing machines. It provided one of the earliest formulations of the single-entry
P′′
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
American mathematician and information theorist (1915–1998)
laboratories' most prominent achievements. For his work, he received the ACM Turing Award in 1968, being its third recipient. After retiring from Bell Labs
Richard_Hamming
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
Programming language for experimentation or art
examples of minimal Turing tarpits and needlessly obfuscated language features. Brainfuck is related to the P′′ family of Turing machines. While esoteric
Esoteric_programming_language
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
List of concepts in artificial intelligence
as well as a neural Turing machine, or a neural network that may be able to access an external memory like a conventional Turing machine, resulting in
Glossary of artificial intelligence
Glossary_of_artificial_intelligence
Calculator product line by Hewlett-Packard
(2020-11-16). Kahan on HP calculators: Solve, Integrate and Matrix Operations. Turing Awardee Clips. Schwartz, Jake (2021). "The PPC Calculator Archive". — A
HP_calculators
(logic) Church–Turing thesis Computable function Algorithm Recursion Primitive recursive function Mu operator Ackermann function Turing machine Halting
List of mathematical logic topics
List_of_mathematical_logic_topics
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
Sterling, Bruce (13 February 2020). "Web Semantics: Microsoft Project Turing introduces Turing Natural Language Generation (T-NLG)". Wired. ISSN 1059-1028. Archived
Timeline of artificial intelligence
Timeline_of_artificial_intelligence
Analysis of computer programs without executing them
reduction to the halting problem, it is possible to prove that (for any Turing complete language), finding all possible run-time errors in an arbitrary
Static_program_analysis
AI that generates content
2023 study showed that generative AI can be vulnerable to jailbreaks, reverse psychology and prompt injection attacks, enabling attackers to obtain help
Generative_AI
Hypothesized risk to human existence
August 2025. Turing, Alan (1951). Intelligent machinery, a heretical theory (Speech). Lecture given to '51 Society'. Manchester: The Turing Digital Archive
Existential risk from artificial intelligence
Existential_risk_from_artificial_intelligence
German computer scientist and engineer (1910–1995)
jumps, the Z3 was a Turing complete computer. However, Turing-completeness was never considered by Zuse (who was unaware of Turing's work and had practical
Konrad_Zuse
Book by Stephen Wolfram
new technical result in describing the Turing completeness of the Rule 110 cellular automaton. Very small Turing machines can simulate Rule 110, which
A_New_Kind_of_Science
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
power of a reversible language is r-Turing completeness, which means the language can simulate any Reversible Turing Machine cleanly (without garbage accumulation)
Reversible programming language
Reversible_programming_language
Computer science technique
defeating the test. In fact, Moni Naor was modest by calling this an automated Turing test. The imitation game described by Alan Turing (1950) didn't
Human-based_computation
Category of mathematical proof
chapter describes Turing machines in the terms of the simpler Post–Turing machine, then proceeds onward with descriptions of Turing's first proof and Chaitin's
Proof_of_impossibility
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
2024-06-07. "No One's Talking About The Amazing Chatbot That Passed The Turing Test 3 Years Ago | Business Insider India". Business Insider. Retrieved 2024-06-07
List of artificial intelligence projects
List_of_artificial_intelligence_projects
CAPTCHA implementation owned by Google
presentation to the DEF CON 18 Hacking Conference detailing a method to reverse the distortion added to images which allowed a computer program to determine
ReCAPTCHA
In model theory, a branch of mathematical logic, the Łoś–Vaught test is a criterion for a theory to be complete, unable to be augmented without becoming
Łoś–Vaught_test
Philosophical position
capable of computing any given algorithm which were developed by Alan Turing (called Turing machines). Putnam himself, by the mid-1970s, had begun questioning
Functionalism (philosophy of mind)
Functionalism_(philosophy_of_mind)
learning is used in diverse types of reverse engineering. For example, machine learning has been used to reverse engineer a composite material part, enabling
Applications of artificial intelligence
Applications_of_artificial_intelligence
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
Type of decision problem in computer science
different type. However, it is also possible to define completeness using Turing reductions, in which one problem can be solved in a polynomial number of
PSPACE-complete
Term used in machine learning
of Stochastic Parrots: Can Language Models Be Too Big? 🦜 (video). Alan Turing Institute. Keynote by Emily Bender. The presentation was followed by a panel
Stochastic_parrot
Theory of consciousness
is the capacity to simulate in real-time for boolean-valued inputs any Turing machine. The DCM being composed of a very large number of interacting sub-networks
Dehaene–Changeux_model
Overview of and topical guide to computer science
calculable with the current models of computers. Proofs developed by Alan Turing and others provide insight into the possibilities of what may be computed
Outline_of_computer_science
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
Philosophical problem-solving principle
Kolmogorov–Chaitin minimum description length approach, the subject must pick a Turing machine whose operations describe the basic operations believed to represent
Occam's_razor
Concept in model theory
substructure N of M is elementary if and only if it passes the Tarski–Vaught test: every first-order formula φ(x, b1, …, bn) with parameters in N that has
Elementary_equivalence
Branch of machine learning
1109/TSMC.1972.4309133. Turing, Alan (1992) [1948]. "Intelligent Machinery". In Ince, D.C. (ed.). Collected Works of AM Turing: Mechanical Intelligence
Deep_learning
Programmable calculator, 1982–1984
Hewlett-Packard in 1981. All members of this series are programmable, use Reverse Polish Notation, and feature continuous memory. Nearly identical in appearance
HP_Voyager
Type of machine learning model
e. a 540-billion-parameter model) in 2022 cost $8 million, and Megatron-Turing NLG 530B (in 2021) cost around $11 million. The qualifier "large" in "large
Large_language_model
AI whose outputs can be understood by humans
assessing how positive film reviews are in the test dataset." The AI may learn useful general rules from the test set, such as "reviews containing the word
Explainable artificial intelligence
Explainable_artificial_intelligence
Sentence that uses every letter of a language's alphabet
finding self-enumerating pangrams". Chapter 35: Sequential sorting. The New Turing Omnibus. § show & tell. Retrieved 2015-10-20. Malin, Irving (2003). "Ella
Pangram
Aspect of WWII Allied intelligence gathering
pattern in the use of adjacent characters in the German plaintext. Alan Turing discovered this weakness and invented the differencing technique described
Cryptanalysis of the Lorenz cipher
Cryptanalysis_of_the_Lorenz_cipher
Open source software driver for Nvidia GPU
Nvidia employees. The project's goal is to create an open source driver by reverse engineering Nvidia's proprietary Linux drivers. It is managed by the X
Nouveau_(software)
doi:10.1006/jcss.1995.1013. Siegelmann, Hava (1995). "Computation Beyond the Turing Limit". Journal of Computer and System Sciences. 238 (28): 632–637. Bibcode:1995Sci
Timeline_of_machine_learning
Decision rule used for minimizing the possible loss for a worst-case scenario
2013 (PDF) (Report). Fraser Institute. p. 25. Professor Raymond Flood. Turing and von Neumann (video). Gresham College – via YouTube. Maschler, Michael;
Minimax
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
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
Zimbabwean-American consultant, researcher and writer
Cambridge as part of The Next Turing Test Conference on the occasion of the 75th anniversary of Alan Turing’s Turing Test. In 2020, 2022, and 2025 he was
James_Manyika
Brand of GPUs by Nvidia
series with RTX 2080 Ti, 2080, and 2070 that will use the Turing architecture. The first Turing cards were slated to ship to consumers on September 20,
GeForce
Logical connective AND
Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision
Logical_conjunction
be so precisely described that a machine can be made to simulate it") Turing test Computing Machinery and Intelligence Intelligent agent and rational agent
Outline of artificial intelligence
Outline_of_artificial_intelligence
Type of logical formula
and Horn clause logic is equivalent in computational power to a universal Turing machine. Van Emden and Kowalski (1976) investigated the model-theoretic
Horn_clause
2015 film score by Ben Salisbury and Geoff Barrow
former composed the track "Bunsen Burner", while the latter produced "The Test Worked" along with the composers. Salisbury had opined that in a film with
Ex_Machina_(soundtrack)
Number divisible only by 1 and itself
ISBN 978-0-201-87073-2. Cooper, S. Barry; Hodges, Andrew (2016). The Once and Future Turing. Cambridge University Press. pp. 37–38. ISBN 978-1-107-01083-3. Rosen 2000
Prime_number
Abstract data type
overflow. Stacks entered the computer science literature in 1946, when Alan Turing used the terms "bury" and "unbury" as a means of calling and returning from
Stack_(abstract_data_type)
Computerized information extraction from images
to a target image (give me all images similar to image X) by utilizing reverse image search techniques, or in terms of high-level search criteria given
Computer_vision
Programmable toy created by Milton Bradley in 1979
Zeon Ltd. There is also a small dedicated Internet community who have reverse engineered the BIG TRAK and the Texas Instruments TMS1000 microcontroller
Big_Trak
Programming paradigm based on applying and composing functions
Alan Turing proved that the lambda calculus and Turing machines are equivalent models of computation, showing that the lambda calculus is Turing complete
Functional_programming
Type of malware
systems. The term "Trojan horse" was popularized by Ken Thompson in his 1983 Turing Award acceptance lecture "Reflections on Trusting Trust", subtitled: "To
Trojan_horse_(computing)
East Asian ethnic group
Fiber Optics"); Fields Medalists Terence Tao and Shing-Tung Yau as well as Turing Award winner Andrew Yao. Tsien Hsue-shen was a prominent aerospace engineer
Han_Chinese
AI model that developer a super-human sorting algorithm
contributed to these performance improvements. The discovered algorithms were reverse-engineered from low-level assembly to C++, and have officially been included
AlphaDev
Philosophical concept
that it does not collapse into the other positions. He uses "reverse zombie" and "reverse knowledge" thought experiments (anti-dualist versions of the
Hard_problem_of_consciousness
Thought experiment in philosophy
Swampman – Philosophical thought experiment concerning personal identity Turing test – Test of a machine's ability to imitate human intelligence Vertiginous question –
Philosophical_zombie
Yes/no problem in computer science
field of recursion theory categorizes undecidable decision problems by Turing degree, which is a measure of the noncomputability inherent in any solution
Decision_problem
3, 2014). "Watch: 2 New Trailers for Tom Hardy's Locke Go Forward & In Reverse". IndieWire. Archived from the original on September 3, 2021. Retrieved
List_of_A24_films
Statistical model for a binary dependent variable
Now, though, automatic software such as OpenBUGS, JAGS, PyMC, Stan or Turing.jl allows these posteriors to be computed using simulation, so lack of conjugacy
Logistic_regression
Marvel Studios film
Barbara (January 5, 2015). "Benedict Cumberbatch on the Beauty of Alan Turing, the Bile of Richard III and the Spirituality of Doctor Strange". The Wall
Doctor_Strange_(2016_film)
Open problem on 3x+1 and x/2 functions
the maximum number of steps taken by any n-state Turing machine that halts. There is a 15-state Turing machine that halts if and only if the following
Collatz_conjecture
push them back across the border. Rather than taking meaningful steps to reverse the PiS legal reforms – designed to consolidate power in the executive
2025 Polish presidential election
2025_Polish_presidential_election
American multinational technology company
nouveau in 2023, which allows proper power management and GPU reclocking for Turing and newer graphics card generations. On July 21, 2025, Nvidia announced
Nvidia
Example: Alan Turing was a computer scientist ante litteram, since the field of "computer science" was not yet recognized in Turing's day. ante meridiem
List_of_Latin_phrases_(full)
REVERSE TURING-TEST
REVERSE TURING-TEST
Male
English
Anglicized form of Welsh Rhys, REESE means "ardor, heat of passion."
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
Muslim/Islamic
Loving Caring, Daring
Male
Welsh
Welsh name derived from the element aur, EURIG means "gold."
Boy/Male
American, British, English
Severe; Strict
Boy/Male
Muslim
Loving, Caring, Daring
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
Shakespearean
King Henry the Sixth, Part III' Lord Rivers, brother to Lady Grey. 'King Richard III' Earl...
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.
Boy/Male
Indian
Loving, Caring, Daring
Male
African
reversed.
Boy/Male
English
Strict. Restrained. Surname.
Girl/Female
American, Australian, Bengali, British, Christian, English, Indian
Springtime; Spring Season; Rapid Movement
Female
English
Elaborated form of English Tara, TARINA means "hill."
Girl/Female
Indian
Lively, Entertainer, From a stream or a Spring, The Spring season, The Spring season
Surname or Lastname
English
English : variant spelling of Revell.
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.
Boy/Male
Hindu, Indian
A Thought
Surname or Lastname
French
French : variant of Rivière, Rivoire, or Rivier, topographic name for someone living on the banks of a river, French rivier ‘bank’, or habitational name from any of the many places in France named with this word.English : nickname from Middle English revere ‘reiver’, ‘robber’.English : topographic name for someone who lived on the brow of a hill, from a misdivision of the Middle English phrase atter evere ‘at the brow or edge’ (from Old English yfer, efer ‘edge’) or a habitational name from a place named with this phrase, as for example River in West Sussex or Rivar in Wiltshire.Jewish (from Italy) : habitational name from a place in Mantua named Revere.The MA patriot Paul Revere (1734–1818), who in April 1775 undertook a famous ride from Boston to Lexington to warn of the approach of British troops, was a silversmith and instrument maker. He was descended from French Huguenots called Rivoire.
Surname or Lastname
English
English : perhaps be a nickname from Middle English daring ‘trembling’, ‘crouching or transfixed with fear’.
REVERSE TURING-TEST
REVERSE TURING-TEST
Girl/Female
Anglo Saxon Welsh English Latin
From Mercia.
Boy/Male
Indian, Sanskrit, Tamil
Key; Love
Male
Italian
Italian form of Latin Gregorius, GREGARIO means "watchful; vigilant."
Boy/Male
Tamil
Rudraswamy | à®°à¯à®¤à¯à®°à®¸à¯à®µà®¾à®®à¯€
The God
Girl/Female
Hindu, Indian
Saffron Coloured
Girl/Female
Indian, Telugu
Goddess of Justice; Glows Forever; Glittering Pearl
Boy/Male
Tamil
Prashanna | பà¯à®°à®·à®¨à®¨à®¾
Cheerful, Pleased, Happy
Boy/Male
Afghan, African, Arabic, Australian, French, Indian, Iranian, Muslim, Parsi
One who Praises; Thankful; A Praiser
Girl/Female
Assamese, Gujarati, Hindu, Indian
Cool
Boy/Male
Hindu, Indian, Traditional
Crest of Victory
REVERSE TURING-TEST
REVERSE TURING-TEST
REVERSE TURING-TEST
REVERSE TURING-TEST
REVERSE TURING-TEST
prep.
In the time of; as long as the action or existence of; as, during life; during the space of a year.
a.
Intended to reverse; implying reversal.
n.
Same as Reverie.
v. i.
To return; to revert.
n.
Alt. of Revery
v. i.
To become or be reversed.
n.
One who reverses.
a.
Alt. of Renverse
v. t.
To reverse.
a.
The act of reversing; complete change; reversal; hence, total change in circumstances or character; especially, a change from better to worse; misfortune; a check or defeat; as, the enemy met with a reverse.
a.
To overthrow by a contrary decision; to make void; to under or annual for error; as, to reverse a judgment, sentence, or decree.
a.
Reversed; as, a reverse shell.
a.
The back side; as, the reverse of a drum or trench; the reverse of a medal or coin, that is, the side opposite to the obverse. See Obverse.
v. i.
To change back, as from a soluble to an insoluble state or the reverse; thus, phosphoric acid in certain fertilizers reverts.
imp. & p. p.
of Reverse
a.
Perverse; adverse; untoward.
n.
One who reveres.
imp. & p. p.
of Revere
a.
Turned backward; having a contrary or opposite direction; hence; opposite or contrary in kind; as, the reverse order or method.
v. t.
To release.