What Is a Write Operation?

Definition

A write operation replaces the symbol at the current tape position with another symbol.

Write updates tape memory at the position where the system is currently focused.

Write does not move the current position.

Write does not decide what should be written.

The transition rule decides which symbol to write.

Write = replace the current tape symbol with a rule-selected symbol

---

Write vs Tape

A tape stores symbols in ordered positions.

A write operation changes one position on that tape.

Example:

Tape:
[1] [0] [1]
     ^
current position

Write:
1

After:
[1] [1] [1]
     ^
current position

The tape is the memory structure.

The write operation updates one cell in that structure.

Tape stores symbols. Write changes the symbol at the current tape position.

---

Basic Example

Before:

[1] [0] [1]
     ^
current position

Write:

1

After:

[1] [1] [1]
     ^
current position

The symbol at the current position changed from 0 to 1.

The current position did not move.

Write changes tape contents, not the current position.

---

Current Position Matters

The same write operation can affect different cells depending on the current position.

Example:

[0] [0] [0]
 ^
write 1

[1] [0] [0]
 ^

Different current position:

[0] [0] [0]
     ^
write 1

[0] [1] [0]
     ^

The symbol written was the same.

The updated cell was different because the current position was different.

Write depends on both the symbol being written and the current position.

---

Writing To A Blank Cell

A write operation can replace a blank symbol.

Example:

Before:
[1] [_] [0]
     ^
current position

Write:
1

After:
[1] [1] [0]
     ^
current position

The blank cell _ was replaced by 1.

This is how unused tape positions can become meaningful parts of memory.

Writing to a blank cell stores information in a previously empty position.

---

Write vs Read

Read and write are different operations.

Read observes the current symbol.

Write replaces the current symbol.

Example:

Tape:
[1] [0] [1]
     ^

Read result:
0

Write:
1

After:
[1] [1] [1]
     ^

Read made the current symbol available to the rule.

Write changed the current symbol according to the rule.

Read observes stored information. Write updates stored information.

---

Key Properties

• Replaces the symbol at the current tape position
• Does not move the current position
• Can change the tape contents
• Usually changes the system state by updating tape memory
• Is selected by a transition rule

If the written symbol is the same as the existing symbol, the visible tape contents may stay the same.

Example:

Before: [1]
Write:  1
After:  [1]

The operation was still a write operation.

But the symbol did not visibly change.

Write is an update operation, even when the new symbol matches the old symbol.

---

Write As Memory Update

The write operation updates tape memory at the current position.

Example:

Initial tape:
[1] [0] [1]
     ^

Write:
1

Updated tape:
[1] [1] [1]
     ^

Later:

Read at same position:
1

What is written now becomes available to later steps.

Write changes what future reads can observe.

---

Overwriting And Information Loss

Writing can overwrite previous information.

Example:

Before:
[0]

Write:
1

After:
[1]

The previous symbol 0 is no longer stored in that cell.

Unless it was stored somewhere else, the system cannot recover it from this cell.

This connects write to memory and information loss:

overwrite = preserve new information, lose old information at that position

Writing can create memory, but it can also erase previous memory.

---

Write Is Chosen By A Rule

Write does not decide what symbol should be written.

A transition rule chooses the write action.

Example:

If read symbol is 0:
  write 1
  move right

If read symbol is 1:
  write 0
  move left

Suppose the read symbol is:

0

Applicable write action:

write 1

The write operation performs the replacement.

The rule determines which replacement is valid.

The rule chooses what to write. Write performs the tape update.

---

Why This Matters

Write matters because it lets computation update memory.

With write, a system can:

• store results
• overwrite old information
• mark progress
• accumulate information across steps
• make future reads see new symbols

Without write:

• tape contents cannot be updated
• future reads keep seeing the same stored symbols
• memory can be inspected, but not changed through tape updates

Write lets computation modify stored information.

---

Final Summary

• Write replaces the symbol at the current tape position.
• Write updates tape memory without moving the current position.
• The current position determines which cell is written.
• Write can replace a blank cell with a symbol.
• Read observes stored information; write updates stored information.
• Write can change the tape contents.
• Writing the same symbol may leave the visible tape unchanged.
• What is written now can affect future reads.
• Overwriting can lose previous information at that position.
• The transition rule chooses what symbol should be written.