Memory (computing) - История изменений

GeloMor в 19:32, 13 сентября 2023

2023-09-13T19:32:08Z

GeloMor в 19:58, 5 сентября 2023

2023-09-05T19:58:05Z

← Предыдущая версия		Версия от 19:58, 5 сентября 2023
Строка 2:		Строка 2:
	{{Computing}}		{{Computing}}

	Память используется для сложения чисел и состояний в [[Computing\|дварфийской компьютерной системе]]. Обычно используется бинарная память, но это не обязательно. Здесь показаны различные способы создания клетки памяти, в зависимости от того, что вы используете, будь то [[mechanical logic\|механическую логику]], [[fluid logic\|жидкостную логику]], [[creature logic\|логику существ]], или [[minecart logic\|вагонеточную логику]]. С бинарной памятью, каждая клетка будет иметь два состояния — 0 и 1, или же ''ложь'' и ''истина''.		'''Память''' используется для сложения чисел и состояний в [[Computing\|дварфийской компьютерной системе]]. Обычно используется бинарная память, но это не обязательно. Здесь показаны различные способы создания клетки памяти, в зависимости от того, что вы используете, будь то [[mechanical logic\|механическую логику]], [[fluid logic\|жидкостную логику]], [[creature logic\|логику существ]], или [[minecart logic\|вагонеточную логику]]. С бинарной памятью, каждая клетка будет иметь два состояния — 0 и 1, или же ''ложь'' и ''истина''.

	===Триггеры против защёлок===		===Триггеры против защёлок===

GeloMor в 18:16, 21 января 2023

2023-01-21T18:16:19Z

← Предыдущая версия		Версия от 18:16, 21 января 2023
Строка 42:		Строка 42:
	Simple fluid logic latches rely on an infinite source and infinite drain, storing information in the form of the presence or absence of water in a particular location.		Simple fluid logic latches rely on an infinite source and infinite drain, storing information in the form of the presence or absence of water in a particular location.

	{{diagram~~\|spaces=yes\|~~		<diagram>
	═════		═════
	[#0F0]~[#0F0]X[#F0F]^[#F00]X[#0FF]~		[#0F0]~[#0F0]X[#F0F]^[#F00]X[#0FF]~
	═════}}		═════</diagram>

	In this design, water flows from an infinite source {{Raw Tile\|~\|#0F0\|#000}} over an output [[pressure plate]] {{Raw Tile\|^\|#F0F\|#000}} toward an infinite drain {{Raw Tile\|~\|#0FF\|#000}}. Its flow is controlled by two [[floodgate]]s, {{Raw Tile\|X\|#0F0\|#000}}, and {{Raw Tile\|X\|#F00\|#000}}, linked to two separate inputs. When {{Raw Tile\|X\|#0F0\|#000}} is open and {{Raw Tile\|X\|#F00\|#000}} closed , water will cover {{Raw Tile\|^\|#F0F\|#000}} and remains so, regardless of the state of {{Raw Tile\|X\|#0F0\|#000}}.		In this design, water flows from an infinite source {{Raw Tile\|~\|#0F0\|#000}} over an output [[pressure plate]] {{Raw Tile\|^\|#F0F\|#000}} toward an infinite drain {{Raw Tile\|~\|#0FF\|#000}}. Its flow is controlled by two [[floodgate]]s, {{Raw Tile\|X\|#0F0\|#000}}, and {{Raw Tile\|X\|#F00\|#000}}, linked to two separate inputs. When {{Raw Tile\|X\|#0F0\|#000}} is open and {{Raw Tile\|X\|#F00\|#000}} closed , water will cover {{Raw Tile\|^\|#F0F\|#000}} and remains so, regardless of the state of {{Raw Tile\|X\|#0F0\|#000}}.
Строка 54:		Строка 54:

	==Creature Logic==		==Creature Logic==
	{{diagram~~\|spaces=yes\|\~~		<diagram>
	╔═╗		╔═╗
	═══╝[#0F0]┼╚══		═══╝[#0F0]┼╚══
	[#F00]p[#FF0]¢[#FF0]^[#FF0]¢[#00F]¢[#F0F][#00F]^[#00F]¢[#F00]p		[#F00]p[#FF0]¢[#FF0]^[#FF0]¢[#00F]¢[#F0F][#00F]^[#00F]¢[#F00]p
	══╗[#0FF]┼╔═══		══╗[#0FF]┼╔═══
	╚═╝ }}		╚═╝ </diagram>

	In this circuit, a creature placed between in the middle seeks its [[path\|pathing]] goal {{Raw Tile\|p\|#F00\|#000}} but is constrained by the [[hatch cover\|hatch]]es {{Raw Tile\|¢\|#FF0\|#000}} and {{Raw Tile\|¢\|#00F\|#000}}, each linked to the pressure plate {{Raw Tile\|^\|#FFF\|#000}} of the same color. When the door {{Raw Tile\|+\|#0F0\|#000}} is opened, the creature can move to the left (false) {{Raw Tile\|^\|#FF0\|#000}}, and when the door {{Raw Tile\|+\|#0FF\|#000}} is opened, the creature can move to the right (true) {{Raw Tile\|^\|#F0F\|#00F}}, thus outputting to anything linked to that pressure plate. This is an example of memory for which it is possible to write a particular state, rather than just toggling, which allows for simpler design for some applications. Note also that rather than writing on a single on or off signal, it depends on an on-off cycle.		In this circuit, a creature placed between in the middle seeks its [[path\|pathing]] goal {{Raw Tile\|p\|#F00\|#000}} but is constrained by the [[hatch cover\|hatch]]es {{Raw Tile\|¢\|#FF0\|#000}} and {{Raw Tile\|¢\|#00F\|#000}}, each linked to the pressure plate {{Raw Tile\|^\|#FFF\|#000}} of the same color. When the door {{Raw Tile\|+\|#0F0\|#000}} is opened, the creature can move to the left (false) {{Raw Tile\|^\|#FF0\|#000}}, and when the door {{Raw Tile\|+\|#0FF\|#000}} is opened, the creature can move to the right (true) {{Raw Tile\|^\|#F0F\|#00F}}, thus outputting to anything linked to that pressure plate. This is an example of memory for which it is possible to write a particular state, rather than just toggling, which allows for simpler design for some applications. Note also that rather than writing on a single on or off signal, it depends on an on-off cycle.
Строка 68:		Строка 68:
	A [[gear assembly]] can function all on its own as a memory cell, being either active or disengaged. However, some complicated applications suggest the use of hybrid mechanical-fluid memory.		A [[gear assembly]] can function all on its own as a memory cell, being either active or disengaged. However, some complicated applications suggest the use of hybrid mechanical-fluid memory.

	{{diagram~~\|spaces=yes\|\~~		<diagram>
	z+2		z+2
	╔═[#0F0]☼╔═╗		╔═[#0F0]☼╔═╗
	║ [#0F0]%[#0A0]% ║		║ [#0F0]%[#0A0]% ║
	╚═╝╚═╝}}		╚═╝╚═╝</diagram>
	{{diagram~~\|spaces=yes\|\~~		<diagram>
	z+1		z+1
	╔═[#FF0]☼╔═╗		╔═[#FF0]☼╔═╗
	║ [#AA0]%[#FF0]%[#F0F]^║		║ [#AA0]%[#FF0]%[#F0F]^║
	╚═╝╚═╝}}		╚═╝╚═╝</diagram>
	{{diagram~~\|spaces=yes\|\~~		<diagram>
	z+0		z+0
	╔═╗		╔═╗
	║[#00F]~║		║[#00F]~║
	╚═╝}}		╚═╝</diagram>

	In this design, two separately powered [[pump stack]]s, {{Raw Tile\|%\|#0F0\|#000}}{{Raw Tile\|%\|#0A0\|#000}} and {{Raw Tile\|%\|#AA0\|#000}}{{Raw Tile\|%\|#FF0\|#000}}, are placed over each other-- the lower one, pumping to the right, and the higher one pumping to the left. When the water {{Raw Tile\|~\|#00F\|#000}} is lying in the rightmost (true) cell, it activates a pressure plate {{Raw Tile\|^\|#F0F\|#000}}. To write true to the memory, one triggers the lower gear assembly {{Raw Tile\|☼\|#FF0\|#000}}, activating the lower pump, and to write false, one activates the higher gear assembly {{Raw Tile\|☼\|#0F0\|#000}} and pump stack. Like the creature logic memory above, this cell can be written as specifically true or false, and depends on an on-off cycle as input.		In this design, two separately powered [[pump stack]]s, {{Raw Tile\|%\|#0F0\|#000}}{{Raw Tile\|%\|#0A0\|#000}} and {{Raw Tile\|%\|#AA0\|#000}}{{Raw Tile\|%\|#FF0\|#000}}, are placed over each other-- the lower one, pumping to the right, and the higher one pumping to the left. When the water {{Raw Tile\|~\|#00F\|#000}} is lying in the rightmost (true) cell, it activates a pressure plate {{Raw Tile\|^\|#F0F\|#000}}. To write true to the memory, one triggers the lower gear assembly {{Raw Tile\|☼\|#FF0\|#000}}, activating the lower pump, and to write false, one activates the higher gear assembly {{Raw Tile\|☼\|#0F0\|#000}} and pump stack. Like the creature logic memory above, this cell can be written as specifically true or false, and depends on an on-off cycle as input.

GeloMor: Категоризация

2019-07-15T14:16:02Z

Категоризация

← Предыдущая версия		Версия от 14:16, 15 июля 2019
Строка 129:		Строка 129:


	[[Категория:~~Компьютеры~~]]		[[Категория:Вычисления]]
	[[en:Memory_(computing)]]		[[en:Memory_(computing)]]

GeloMor: Интервики

2019-06-28T22:24:45Z

Интервики

← Предыдущая версия		Версия от 22:24, 28 июня 2019
Строка 129:		Строка 129:


	~~{{Category\|~~Компьютеры}}		[[Категория:Компьютеры]]
			[[en:Memory_(computing)]]

GeloMor: latch-триггер обычно переводят как триггер защелки, flip-flop - как двуступенчатые или шлёпающие триггеры, но на практике говорят просто защёлки

2018-10-19T18:00:05Z

latch-триггер обычно переводят как триггер защелки, flip-flop - как двуступенчатые или шлёпающие триггеры, но на практике говорят просто защёлки

← Предыдущая версия		Версия от 18:00, 19 октября 2018
Строка 4:		Строка 4:
	Память используется для сложения чисел и состояний в [[Computing\|дварфийской компьютерной системе]]. Обычно используется бинарная память, но это не обязательно. Здесь показаны различные способы создания клетки памяти, в зависимости от того, что вы используете, будь то [[mechanical logic\|механическую логику]], [[fluid logic\|жидкостную логику]], [[creature logic\|логику существ]], или [[minecart logic\|вагонеточную логику]]. С бинарной памятью, каждая клетка будет иметь два состояния — 0 и 1, или же ''ложь'' и ''истина''.		Память используется для сложения чисел и состояний в [[Computing\|дварфийской компьютерной системе]]. Обычно используется бинарная память, но это не обязательно. Здесь показаны различные способы создания клетки памяти, в зависимости от того, что вы используете, будь то [[mechanical logic\|механическую логику]], [[fluid logic\|жидкостную логику]], [[creature logic\|логику существ]], или [[minecart logic\|вагонеточную логику]]. С бинарной памятью, каждая клетка будет иметь два состояния — 0 и 1, или же ''ложь'' и ''истина''.

	===Триггеры против ~~задвижек<sup>''(?)''</sup>~~===		===Триггеры против защёлок===
	Наиболее базовая характеристика памяти в Dwarf Fortress заключается в том, что что она действует как разделитель сигналов: даётся серия on-off сигнальных циклов, и выходит серией переменных on или off сигналов. Память, действующая по такой, и только такой, схеме, работает как триггер: каждый раз вы ~~запускаете память~~, ~~меняющая~~ состояние. Такая память идеально подходит для таких устройств, как [[Adder (Computing)\|счетчики]]. ''Тем не менее, обычно хочется возможность ~~самому~~ изменять состояние памяти, вместо того, чтобы переключать его-- т.е., писать либо '''истину''' или '''ложь''' в память самому, без знания текущего состояния памяти~~''<sup>?</sup>~~.		Наиболее базовая характеристика памяти в Dwarf Fortress заключается в том, что что она действует как разделитель сигналов: даётся серия on-off сигнальных циклов, и выходит серией переменных on или off сигналов. Память, действующая по такой, и только такой, схеме, работает как триггер: каждый раз вы воздействуете на ячейку памяти, она меняет состояние. Такая память идеально подходит для таких устройств, как [[Adder (Computing)\|счетчики]]. Тем не менее, обычно хочется иметь возможность непосредственно изменять состояние памяти вместо того, чтобы переключать его, т. е. писать либо '''истину''' или '''ложь''' в память самому, без знания текущего состояния памяти. Это можно описать таблицей, в которой значение памяти возвращается обратно в себя:
	Это можно описать таблицей, в которой значение памяти возвращается обратно в себя:
	{\| class="wikitable" border=1		{\| class="wikitable" border=1
	\|-		\|-
	! Вход		! Вход
	! Состояние ~~задвижки~~		! Состояние защёлок
	! Выход		! Выход
	! Новое состояние ~~задвижки~~		! Новое состояние защёлок
	\|-		\|-
	\| 0		\| 0

PixCat: /* Flip-flops versus latches */

2018-10-19T11:58:47Z

Flip-flops versus latches

← Предыдущая версия		Версия от 11:58, 19 октября 2018
Строка 4:		Строка 4:
	Память используется для сложения чисел и состояний в [[Computing\|дварфийской компьютерной системе]]. Обычно используется бинарная память, но это не обязательно. Здесь показаны различные способы создания клетки памяти, в зависимости от того, что вы используете, будь то [[mechanical logic\|механическую логику]], [[fluid logic\|жидкостную логику]], [[creature logic\|логику существ]], или [[minecart logic\|вагонеточную логику]]. С бинарной памятью, каждая клетка будет иметь два состояния — 0 и 1, или же ''ложь'' и ''истина''.		Память используется для сложения чисел и состояний в [[Computing\|дварфийской компьютерной системе]]. Обычно используется бинарная память, но это не обязательно. Здесь показаны различные способы создания клетки памяти, в зависимости от того, что вы используете, будь то [[mechanical logic\|механическую логику]], [[fluid logic\|жидкостную логику]], [[creature logic\|логику существ]], или [[minecart logic\|вагонеточную логику]]. С бинарной памятью, каждая клетка будет иметь два состояния — 0 и 1, или же ''ложь'' и ''истина''.

	===~~Flip-flops versus latches~~===		===Триггеры против задвижек<sup>''(?)''</sup>===
	~~The most basic characteristic of memory in~~ Dwarf Fortress ~~is that it acts as a signal splitter~~: ~~given a series of~~ on-off ~~signal cycles~~, ~~it outputs a series of alternating~~ on or off ~~signals~~. ~~Memory that does this~~, ~~and only this~~, ~~acts like a flip-flop~~: ~~every time you trigger the memory~~, ~~it changes state~~. ~~Such memory is perfect for devices such as~~ [[Adder (Computing)\|~~counters~~]]. ~~However~~, ~~it's common to desire the ability to write state directly to your memory~~, ~~rather than toggling it~~-- ~~that is~~, ~~to write either~~ '''~~true~~''' or '''~~false~~''' ~~to memory directly~~, ~~without knowing the current state of the memory~~. ~~This can be described with a chart where the memory value feeds back into itself~~:		Наиболее базовая характеристика памяти в Dwarf Fortress заключается в том, что что она действует как разделитель сигналов: даётся серия on-off сигнальных циклов, и выходит серией переменных on или off сигналов. Память, действующая по такой, и только такой, схеме, работает как триггер: каждый раз вы запускаете память, меняющая состояние. Такая память идеально подходит для таких устройств, как [[Adder (Computing)\|счетчики]]. ''Тем не менее, обычно хочется возможность самому изменять состояние памяти, вместо того, чтобы переключать его-- т.е., писать либо '''истину''' или '''ложь''' в память самому, без знания текущего состояния памяти''<sup>?</sup>.
			Это можно описать таблицей, в которой значение памяти возвращается обратно в себя:
	{\| class="wikitable" border=1		{\| class="wikitable" border=1
	\|-		\|-
	! ~~input~~		! Вход
	! ~~latch state~~		! Состояние задвижки
	! ~~output~~		! Выход
	! ~~new latch state~~		! Новое состояние задвижки
	\|-		\|-
	\| 0		\| 0
Строка 33:		Строка 34:
	\| 1		\| 1
	\|}<br />		\|}<br />

	===Performance===		===Performance===
	Memory systems in a dwarf fortress, thankfully, are very good at maintaining their value (in the absence of any [[troll]]s), but they are still plagued by problems with latency and long refractory periods. Latency refers to the length of time before which a change in value will register, and the refractory period refers to the period after writing to memory during which one cannot reliably write to it a second time. Because of the delays involved with [[pressure plate]]s, latency and refractory period for a given memory cell often depend on which state the memory is being changed to. For instance, the mechanical hybrid cell below has nearly no latency when being written as true, but around 100 ticks of latency when being written as false.		Memory systems in a dwarf fortress, thankfully, are very good at maintaining their value (in the absence of any [[troll]]s), but they are still plagued by problems with latency and long refractory periods. Latency refers to the length of time before which a change in value will register, and the refractory period refers to the period after writing to memory during which one cannot reliably write to it a second time. Because of the delays involved with [[pressure plate]]s, latency and refractory period for a given memory cell often depend on which state the memory is being changed to. For instance, the mechanical hybrid cell below has nearly no latency when being written as true, but around 100 ticks of latency when being written as false.

GeloMor: Категоризация

2018-09-04T05:25:11Z

Категоризация

← Предыдущая версия		Версия от 05:25, 4 сентября 2018
Строка 128:		Строка 128:


	{{Category\|~~Computing~~}}		{{Category\|Компьютеры}}

PixCat в 11:33, 20 августа 2018

2018-08-20T11:33:10Z

← Предыдущая версия		Версия от 11:33, 20 августа 2018
Строка 2:		Строка 2:
	{{Computing}}		{{Computing}}

	~~Memory is used for storing values and states in dwarven~~ [[~~computing~~]]. ~~Typically~~, ~~binary memory is used~~, ~~but this isn't strictly necessary. There are multiple ways to set up a memory cell~~, ~~depending on whether one is using~~ [[mechanical logic\|~~mechanical~~]], [[fluid logic\|~~fluid~~]], [[creature logic]], or [[minecart logic]]. ~~With binary memory, each cell has two possible states~~, ~~generally referred to as~~ 0 ~~and~~ 1, ~~or true and false~~.		Память используется для сложения чисел и состояний в [[Computing\|дварфийской компьютерной системе]]. Обычно используется бинарная память, но это не обязательно. Здесь показаны различные способы создания клетки памяти, в зависимости от того, что вы используете, будь то [[mechanical logic\|механическую логику]], [[fluid logic\|жидкостную логику]], [[creature logic\|логику существ]], или [[minecart logic\|вагонеточную логику]]. С бинарной памятью, каждая клетка будет иметь два состояния — 0 и 1, или же ''ложь'' и ''истина''.

	===Flip-flops versus latches===		===Flip-flops versus latches===

PixCat: Новая страница: «{{Переделать|требуется перевод}} {{Computing}} Memory is used for storing values and states in dwarven computing. Typically, binar…»

2018-08-20T11:13:15Z

Новая страница: «{{Переделать|требуется перевод}} {{Computing}} Memory is used for storing values and states in dwarven computing. Typically, binar…»

Новая страница

{{Переделать|требуется перевод}}
{{Computing}}

Memory is used for storing values and states in dwarven [[computing]]. Typically, binary memory is used, but this isn't strictly necessary. There are multiple ways to set up a memory cell, depending on whether one is using [[mechanical logic|mechanical]], [[fluid logic|fluid]], [[creature logic]], or [[minecart logic]]. With binary memory, each cell has two possible states, generally referred to as 0 and 1, or true and false.

===Flip-flops versus latches===
The most basic characteristic of memory in Dwarf Fortress is that it acts as a signal splitter: given a series of on-off signal cycles, it outputs a series of alternating on or off signals. Memory that does this, and only this, acts like a flip-flop: every time you trigger the memory, it changes state. Such memory is perfect for devices such as [[Adder (Computing)|counters]]. However, it's common to desire the ability to write state directly to your memory, rather than toggling it-- that is, to write either '''true''' or '''false''' to memory directly, without knowing the current state of the memory. This can be described with a chart where the memory value feeds back into itself:
{| class="wikitable" border=1
|-
! input
! latch state
! output
! new latch state
|-
| 0
| 0
| none
| 0
|-
| 0
| 1
| off
| 0
|-
| 1
| 0
| on
| 1
|-
| 1
| 1
| none
| 1
|}<br />
===Performance===
Memory systems in a dwarf fortress, thankfully, are very good at maintaining their value (in the absence of any [[troll]]s), but they are still plagued by problems with latency and long refractory periods. Latency refers to the length of time before which a change in value will register, and the refractory period refers to the period after writing to memory during which one cannot reliably write to it a second time. Because of the delays involved with [[pressure plate]]s, latency and refractory period for a given memory cell often depend on which state the memory is being changed to. For instance, the mechanical hybrid cell below has nearly no latency when being written as true, but around 100 ticks of latency when being written as false.

Some designs can trade simplicity or material needs for costs in performance.

==Fluid Logic==
Simple fluid logic latches rely on an infinite source and infinite drain, storing information in the form of the presence or absence of water in a particular location.

{{diagram|spaces=yes|
═════
[#0F0]~[#0F0]X[#F0F]^[#F00]X[#0FF]~
═════}}

In this design, water flows from an infinite source {{Raw Tile|~|#0F0|#000}} over an output [[pressure plate]] {{Raw Tile|^|#F0F|#000}} toward an infinite drain {{Raw Tile|~|#0FF|#000}}. Its flow is controlled by two [[floodgate]]s, {{Raw Tile|X|#0F0|#000}}, and {{Raw Tile|X|#F00|#000}}, linked to two separate inputs. When {{Raw Tile|X|#0F0|#000}} is open and {{Raw Tile|X|#F00|#000}} closed , water will cover {{Raw Tile|^|#F0F|#000}} and remains so, regardless of the state of {{Raw Tile|X|#0F0|#000}}.

If {{Raw Tile|X|#F00|#000}} is opened while {{Raw Tile|X|#0F0|#000}} is closed, water will leave {{Raw Tile|^|#F0F|#000}} and the tile will remain empty of water until {{Raw Tile|X|#0F0|#000}} opens again.

This design has relatively high latency, because of the 100 tick delay associated with floodgates. Replacing the floodgates with doors, which have no reaction delay, greatly accelerates the response of the latch, but the overall performance is still limited by the reset period of pressure plates. Given careful enough design and sufficient water pressure, the latency of a write to true can approach 10, with the latency of a write to false around 110.

==Creature Logic==
{{diagram|spaces=yes|\
╔═╗
═══╝[#0F0]┼╚══
[#F00]p[#FF0]¢[#FF0]^[#FF0]¢[#00F]¢[#F0F][#00F]^[#00F]¢[#F00]p
══╗[#0FF]┼╔═══
╚═╝ }}

In this circuit, a creature placed between in the middle seeks its [[path|pathing]] goal {{Raw Tile|p|#F00|#000}} but is constrained by the [[hatch cover|hatch]]es {{Raw Tile|¢|#FF0|#000}} and {{Raw Tile|¢|#00F|#000}}, each linked to the pressure plate {{Raw Tile|^|#FFF|#000}} of the same color. When the door {{Raw Tile|+|#0F0|#000}} is opened, the creature can move to the left (false) {{Raw Tile|^|#FF0|#000}}, and when the door {{Raw Tile|+|#0FF|#000}} is opened, the creature can move to the right (true) {{Raw Tile|^|#F0F|#00F}}, thus outputting to anything linked to that pressure plate. This is an example of memory for which it is possible to write a particular state, rather than just toggling, which allows for simpler design for some applications. Note also that rather than writing on a single on or off signal, it depends on an on-off cycle.

This design has good latency for creature logic systems, resulting in on signals around 40 ticks after writes and off signals around 150 ticks after writes. It has a 110 tick refractory period, representing the time necessary for the hatch covers to close.

==Mechanical Logic==
A [[gear assembly]] can function all on its own as a memory cell, being either active or disengaged. However, some complicated applications suggest the use of hybrid mechanical-fluid memory.

{{diagram|spaces=yes|\
z+2
╔═[#0F0]☼╔═╗
║ [#0F0]%[#0A0]% ║
╚═╝╚═╝}}
{{diagram|spaces=yes|\
z+1
╔═[#FF0]☼╔═╗
║ [#AA0]%[#FF0]%[#F0F]^║
╚═╝╚═╝}}
{{diagram|spaces=yes|\
z+0
╔═╗
║[#00F]~║
╚═╝}}

In this design, two separately powered [[pump stack]]s, {{Raw Tile|%|#0F0|#000}}{{Raw Tile|%|#0A0|#000}} and {{Raw Tile|%|#AA0|#000}}{{Raw Tile|%|#FF0|#000}}, are placed over each other-- the lower one, pumping to the right, and the higher one pumping to the left. When the water {{Raw Tile|~|#00F|#000}} is lying in the rightmost (true) cell, it activates a pressure plate {{Raw Tile|^|#F0F|#000}}. To write true to the memory, one triggers the lower gear assembly {{Raw Tile|☼|#FF0|#000}}, activating the lower pump, and to write false, one activates the higher gear assembly {{Raw Tile|☼|#0F0|#000}} and pump stack. Like the creature logic memory above, this cell can be written as specifically true or false, and depends on an on-off cycle as input.

This design has very good latency (from almost nothing for a write as true to 100 ticks for a write as false) and no real refractory period-- it can be written to immediately following a previous write, although it does depend on the completion of the previous write signal (receiving the off component of the signal) before writing again.

===Memory versus Power-to-signal===
It can be tricky to differentiate memory from [[Mechanical_logic#Power_to_signal_converter|power to signal]] conversion. Through feedback, power-to-signal devices can often be changed into memory cells, and powered memory devices can be adapted into power-to-signal. Previous to the introduction of minecarts, the most common power-to-signal device bore strong resemblance to the memory cell described above. There is, however, a large difference between memory and power-to-signal. While memory designs receive on-off signal cycles and output discrete '''on''' or '''off''' signals in return, power-to-signal converters translate one type of binary information (power on/off) into another (signal on/off). That is, a signalling device that receives then loses power should return a full on-off signal cycle.

==Minecart Logic==
There are numerous ways for minecarts to hold information. Some memory designs use movement or the absence of movement; others use just the position of a minecart. Advanced designs could use the weight or direction of movement of a minecart. The following powered minecart design by Bloodbeard is the smallest memory circuit currently known to dwarvenkind:

<diagram fg=7:0>
Key:
O O Wall
[#0:0][@6:0][%254][#2:1][@][%15] [#0:0][@6:0][%254][#@] Copper minecart
[#0:0][@7:0][%254][#@] [#0:0][@7:0][%254][#@] Iron minecart
[#7:1][@][%207][#2:0][%15][#] [#2:1][%15][#2:0][%15][#] Gears
O [#7:1][%207][#] Rollers
[#5:1]^[#] Pressure plate
O [#7:1][%186][#] Minecart tracks
[#7:1][%207][#2:1][@][%15] [#7:1][%210] [%208][#] Track ends
[#5:1]^
[#7:1][%207][#2:0][%15][#]
O

O
[#7:1][%210][#2:1][@][%15]
[#7:1][%186]
[%208][#2:0][%15][#]
O

</diagram>

The diagram shows the minecart layer at the top, the roller/furniture layer in the middle, and finally the track layer at the bottom.
When the northern gear assembly is activated, powering the northern roller, a heavy minecart (copper, in this example) is pushed southwards. This pushes a lighter minecart (iron here) south, and triggers a pressure plate that is built to only signal on the weight of a copper minecart, and not on the weight of the lighter iron minecart.
With the activation of the southern gear assembly, the situation reverses. The iron minecart pushes on to the pressure plate, and an '''off''' signal is sent.

==Memory addressing==
In complicated designs, one may wish to use a memory cell abstractly-- to represent any number of different values. To use multiple such abstract cells, it's necessary to specify exactly which memory cell one wishes to read from or write to at any given moment.

This is simplest in mechanical logic. A grid of gear assemblies can represent rows and columns, and by disengaging control gears for all but the cell that lies at that particular row/column intersection, one can easily refer to a specific cell. Strict fluid logic can do something similar, by controlling the input of water to memory cells, although this involves long delays. With the creature logic design, one can use additional doors to restrict writes to any cells not referenced.

==Alternate design==
Because most memory is used for a specific application, there is no single best design. It is not uncommon to see functionality built into memory circuits-- a simple circuit that increments contains its own memory. Alternate designs are important when memory needs to be written to in various ways (toggle versus specific value) or when latency and refractory period are unimportant compared to resource requirements such as space.

{{Category|Computing}}