irredundant automaton - translation to ρωσικά
Diclib.com
Λεξικό ChatGPT
Εισάγετε μια λέξη ή φράση σε οποιαδήποτε γλώσσα 👆
Γλώσσα:

Μετάφραση και ανάλυση λέξεων από την τεχνητή νοημοσύνη ChatGPT

Σε αυτήν τη σελίδα μπορείτε να λάβετε μια λεπτομερή ανάλυση μιας λέξης ή μιας φράσης, η οποία δημιουργήθηκε χρησιμοποιώντας το ChatGPT, την καλύτερη τεχνολογία τεχνητής νοημοσύνης μέχρι σήμερα:

  • πώς χρησιμοποιείται η λέξη
  • συχνότητα χρήσης
  • χρησιμοποιείται πιο συχνά στον προφορικό ή γραπτό λόγο
  • επιλογές μετάφρασης λέξεων
  • παραδείγματα χρήσης (πολλές φράσεις με μετάφραση)
  • ετυμολογία

irredundant automaton - translation to ρωσικά

CHESS-PLAYING "PSEUDO-AUTOMATON" BUILT IN 1876
Mephisto (Automaton); Mephisto automaton

irredundant automaton      

математика

неизбыточный автомат

cellular automaton         
  • Rule 110
  • Rule 30
  • Visualization of a lattice gas automaton. The shades of grey of the individual pixels are proportional to the gas particle density (between 0 and 4) at that pixel. The gas is surrounded by a shell of yellow cells that act as reflectors to create a closed space.
  • Los Alamos]] ID badge
  • An animation of the way the rules of a 1D cellular automaton determine the next generation.
  • A cellular automaton based on hexagonal cells instead of squares (rule 34/2)
  • ''[[Conus textile]]'' exhibits a cellular automaton pattern on its shell.<ref name=coombs/>
  • A [[torus]], a toroidal shape
DISCRETE MODEL STUDIED IN COMPUTABILITY THEORY, MATHEMATICS, PHYSICS, COMPLEXITY SCIENCE, THEORETICAL BIOLOGY AND MICROSTRUCTURE MODELING
Seluler Atomatons; Cellular image processing; Cellular autonoma; Cellular Automata; Cellular Automaton; Celullar automaton; Cellular Automata machine; Cellular robotics; Cell games (cellular automaton); Cellular automata machine; Cellular automota; Cellular automata; Cellular automata in popular culture; Fuzzy cellular automata; Fuzzy cellular automaton; Non-totalistic; Applications of cellular automata; Totalistic cellular automata; Cellular automaton theory; Cellular automatons; Tessellation automata

математика

клеточный автомат

cellular automata         
  • Rule 110
  • Rule 30
  • Visualization of a lattice gas automaton. The shades of grey of the individual pixels are proportional to the gas particle density (between 0 and 4) at that pixel. The gas is surrounded by a shell of yellow cells that act as reflectors to create a closed space.
  • Los Alamos]] ID badge
  • An animation of the way the rules of a 1D cellular automaton determine the next generation.
  • A cellular automaton based on hexagonal cells instead of squares (rule 34/2)
  • ''[[Conus textile]]'' exhibits a cellular automaton pattern on its shell.<ref name=coombs/>
  • A [[torus]], a toroidal shape
DISCRETE MODEL STUDIED IN COMPUTABILITY THEORY, MATHEMATICS, PHYSICS, COMPLEXITY SCIENCE, THEORETICAL BIOLOGY AND MICROSTRUCTURE MODELING
Seluler Atomatons; Cellular image processing; Cellular autonoma; Cellular Automata; Cellular Automaton; Celullar automaton; Cellular Automata machine; Cellular robotics; Cell games (cellular automaton); Cellular automata machine; Cellular automota; Cellular automata; Cellular automata in popular culture; Fuzzy cellular automata; Fuzzy cellular automaton; Non-totalistic; Applications of cellular automata; Totalistic cellular automata; Cellular automaton theory; Cellular automatons; Tessellation automata

общая лексика

CA

клеточный автомат, КА

модель или устройство, состоящее из сетки работающих параллельно клеток, каждая из которых связана с соседними правилами взаимодействия (cellular rules). Каждая клетка может находится в одном из нескольких заданных состояний, зависящих от состояния её соседей. Все изменения состояний клеток происходят синхронно в дискретные моменты времени. КА бывают однородными (uniform CA), если одни и те же правила действуют для всех клеток, и неоднородными (non-uniform CA) в противном случае

Ορισμός

cellular automaton
<algorithm, parallel> (CA, plural "- automata") A regular spatial lattice of "cells", each of which can have any one of a finite number of states. The state of all cells in the lattice are updated simultaneously and the state of the entire lattice advances in discrete time steps. The state of each cell in the lattice is updated according to a local rule which may depend on the state of the cell and its neighbors at the previous time step. Each cell in a cellular automaton could be considered to be a finite state machine which takes its neighbours' states as input and outputs its own state. The best known example is J.H. Conway's game of Life. {FAQ (http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html)}. Usenet newsgroups: news:comp.theory.cell-automata, news:comp.theory.self-org-sys. (1995-03-03)

Βικιπαίδεια

Mephisto (automaton)

Mephisto was the name given to a chess-playing "pseudo-automaton" built in 1876. Unlike The Turk and Ajeeb it had no hidden operator, instead being remotely controlled by electromechanical means.

Constructed by Charles Godfrey Gumpel (c.1835 - 1921), an Alsatian manufacturer of artificial limbs, it took some 6 or 7 years to build and was first shown in 1878 at Gumpel's home in Leicester Square, London. Mephisto was mainly operated by chess master Isidor Gunsberg.

Μετάφραση του &#39irredundant automaton&#39 σε Ρωσικά