tanszek:oktatas:techcomm:system:system
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| tanszek:oktatas:techcomm:system:system [2026/09/21 14:39] – [Turing Machine: Add One to a Binary Number] knehez | tanszek:oktatas:techcomm:system:system [2026/09/28 16:31] (current) – knehez | ||
|---|---|---|---|
| Line 5: | Line 5: | ||
| {{: | {{: | ||
| - | In the example system, there are elements belonging to classes A, B, and C, and there are connections of types ' | + | In the example system, there are elements belonging to classes |
| - | The internal | + | Physical |
| **Example** | **Example** | ||
| Line 18: | Line 18: | ||
| ==== What Is a Turing Machine? ==== | ==== What Is a Turing Machine? ==== | ||
| - | A **Turing machine** is a simple mathematical model of a computer. It has a tape divided into cells, a read/write head, and a finite set of states. The tape provides unlimited memory, and each cell contains one symbol. | + | A **Turing machine** is a simple mathematical model of a computer. It has a tape divided into cells, a read/write head, and a finite set of states. The tape provides unlimited memory, and each cell contains one symbol. At each step, the machine reads the symbol under the head. Based on this symbol and its current state, it writes a symbol, moves the head, and selects the next state. These actions follow fixed rules called **transitions**. Although its structure is simple, a Turing machine can perform any computation describable by an algorithm, given enough time and tape. |
| - | + | ||
| - | At each step, the machine reads the symbol under the head. Based on this symbol and its current state, it writes a symbol, moves the head, and selects the next state. These actions follow fixed rules called **transitions**. | + | |
| - | + | ||
| - | Although its structure is simple, a Turing machine can perform any computation describable by an algorithm, given enough time and tape. | + | |
| ==== Task ==== | ==== Task ==== | ||
| A binary number is written on the tape. The reading head starts at the first digit. | A binary number is written on the tape. The reading head starts at the first digit. | ||
| + | |||
| + | < | ||
| + | block-beta | ||
| + | columns 5 | ||
| + | head[" | ||
| + | a[" | ||
| + | head --> a | ||
| + | style a fill:# | ||
| + | </ | ||
| Create a Turing machine that adds **1** to the number and then stops. | Create a Turing machine that adds **1** to the number and then stops. | ||
| Line 141: | Line 146: | ||
| There are signals with constant values over time and those with changing values over time. Information is often conveyed by the change in the signal over time. The four main types of signals are: | There are signals with constant values over time and those with changing values over time. Information is often conveyed by the change in the signal over time. The four main types of signals are: | ||
| - | **1. Analog | + | **1. Analog |
| The signal is continuous in both time and value. | The signal is continuous in both time and value. | ||
| Line 147: | Line 152: | ||
| The signal is discrete in value. | The signal is discrete in value. | ||
| - | **3. Sampled | + | **3. Sampled |
| The signal is discrete in time. | The signal is discrete in time. | ||
| Line 155: | Line 160: | ||
| The mathematical model of signals: a time-varying function. The model of a signal can be deterministic or stochastic. A stochastic signal is a composition of the useful signal and noise. A stochastic signal changes randomly. Stochastic signals can only be modelled using statistical methods. | The mathematical model of signals: a time-varying function. The model of a signal can be deterministic or stochastic. A stochastic signal is a composition of the useful signal and noise. A stochastic signal changes randomly. Stochastic signals can only be modelled using statistical methods. | ||
| - | {{: | + | {{: |
tanszek/oktatas/techcomm/system/system.1790001553.txt.gz · Last modified: by knehez
