New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Máquina de Turing: Conceptos Clave

Crossword Puzzle

Played 16

About this activity

Conceptos clave de la Máquina de Turing.

Created by

Mexico

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Máquina de Turing: Conceptos Clave
 

Crossword Puzzle

Máquina de Turing: Conceptos ClaveOnline version

Conceptos clave de la Máquina de Turing.

by mauricio cardoso
1

El medio físico (infinito en teoría) donde la máquina lee y escribe símbolos.

2

La condición interna en la que se encuentra la máquina en un momento dado.

3

Conjunto finito de símbolos que la máquina puede reconocer y escribir.

4

El componente que se mueve a la izquierda o derecha para interactuar con la cinta.

5

Tipo de máquina que, para un estado y símbolo dado, solo tiene una acción posible.

6

Modelo de máquina de Turing capaz de simular a cualquier otra máquina de Turing.

7

La función o regla que dicta qué debe hacer la máquina según lo que lee.

8

Variante que utiliza varias pistas de lectura/escritura para mayor eficiencia.

9

El estado final que indica que la cadena de entrada es válida.

10

Concepto que la Máquina de Turing ayudó a definir formalmente.

2
1
10
6
8
7
4
9
Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.