- erase table
- подложка для исправления ошибок (в пишущей машине)
Большой англо-русский и русско-английский словарь. 2001.
erase table
Смотреть что такое "erase table" в других словарях:
Table of keyboard shortcuts — In computing, a keyboard shortcut is a sequence or combination of keystrokes on a computer keyboard which invokes commands in software. Some keyboard shortcuts require the user to press a single key or a sequence of keys one after the other.… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Post–Turing machine — The article Turing machine gives a general introduction to Turing machines, while this article covers a specific class of Turing machines. A Post–Turing machine is a program formulation of an especially simple type of Turing machine, comprising a … Wikipedia
Random access machine — In computer science, random access machine (RAM) is an abstract machine in the general class of register machines. The RAM is very similar to the counter machine but with the added capability of indirect addressing of its registers. Like the… … Wikipedia
Turing machine equivalents — Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine Read only right moving Turing Machines Probabilistic Turing machine Multi track Turing machine Turing machine… … Wikipedia
Static Wear Leveling — articleissues article=y context=December 2007 technical=June 2008 copyedit=June 2008Applications of NAND flash memory have now grown much beyond its original design goals. For instance, Intel proposed the Robson solution by using flash memory as… … Wikipedia
Register machine — In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. Contents 1 Overview 2 Formal definition 3 … Wikipedia
Turing machine examples — The following are examples to supplement the article Turing machine.Turing s very first exampleThe following table is Turing s very first example (Turing 1936):: 1. A machine can be constructed to compute the sequence 0 1 0 1 0 1... ( Undecidable … Wikipedia
Kid Cudi — pendant un concert à San Francisco, en juillet 2009 Surnom KIDDY, Cudi, Cud, The Duder, Scotty McFlyy, Cudder, The Rager, Mr. Rager, Kid, K … Wikipédia en Français
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
Whiteboard — This article is about physical whiteboards. For software based whiteboards, see Whiteboarding. A blank whiteboard A whiteboard (also known by the terms markerboard, dry erase board, dry wipe board, pen board, and the misnomer greaseboard) is a… … Wikipedia
