Перейти к содержимому

Turing complete что это

  • автор:

Turing Complete

Turing Complete бросит вызов вашему пониманию компьютеров и программирования. Вы начнете с простейшего строительного блока компьютера, NAND-гейта, и будете использовать его для создания более сложных компонентов, таких как арифметические блоки, модули памяти и архитектуры процессоров. Вы также узнаете, как язык ассемблера, наборы команд процессора и концепции программирования, такие как операторы if, циклы и функции, реализуются в аппаратном обеспечении.

Игра представляет собой не линейную последовательность головоломок, а песочницу, где вы можете экспериментировать и создавать свои собственные компьютеры. Вы можете подключать различные устройства, такие как экраны, таймеры, звук, клавиатурный ввод и сетевые компоненты, и разрабатывать свой собственный язык ассемблера для вашего компьютера. Игра основана на мощном симуляторе, который дает вам полный контроль и гибкость над вашими творениями. Turing Complete подойдет для тех, кому интересно, как работают компьютеры на самом низком уровне. Представленный проект проверит вашу логику, творческие способности и навыки решения проблем. Тьюринг Комплит научит вас основам компьютерной науки и инженерии, а также позволит вам оценить красоту и элегантность компьютеров и программирования.

Turing complete что это

About this game

Turing Complete is a game about computer science. If you enjoy the thrill of figuring things out and those moments where a deeper perspective is revealed about something you thought you understood, this game is for you.

Logic gates are the fundamental building blocks of computation. Given only a nand gate you create the rest.

Building on logic gates and introducing memory, more complex constructions are possible.

Assemble your components into real computers. Turing complete computers are the gold standard, Turing complete meaning a computer that is capable of computing the same algorithms as a Turing machine.

Computers are programmed with binary codes. Create assembly instructions to simplify this and solve programming puzzles on your own hardware.

What is Turing Complete?

Can you give a simple explanation, without going into too many theoretical details?

Mark Harrison's user avatar

14 Answers 14

Here’s the briefest explanation:

A Turing Complete system means a system in which a program can be written that will find an answer (although with no guarantees regarding runtime or memory).

So, if somebody says "my new thing is Turing Complete" that means in principle (although often not in practice) it could be used to solve any computation problem.

Sometimes it’s a joke. a guy wrote a Turing Machine simulator in vi, so it’s possible to say that vi is the only computational engine ever needed in the world.

Mark Harrison's user avatar

Here is the simplest explanation

Alan Turing created a machine that can take a program, run that program, and show some result. But then he had to create different machines for different programs. So he created "Universal Turing Machine" that can take ANY program and run it.

Programming languages are similar to those machines (although virtual). They take programs and run them. Now, a programing language is called "Turing complete", if it can run any program (irrespective of the language) that a Turing machine can run given enough time and memory.

For example: Let’s say there is a program that takes 10 numbers and adds them. A Turing machine can easily run this program. But now imagine that for some reason your programming language can’t perform the same addition. This would make it "Turing incomplete" (so to speak). On the other hand, if it can run any program that the universal Turing machine can run, then it’s Turing complete.

Most modern programming languages (e.g. Java, JavaScript, Perl, etc.) are all Turing complete because they each implement all the features required to run programs like addition, multiplication, if-else condition, return statements, ways to store/retrieve/erase data and so on.

Prithvi Boinpally's user avatar

Informal Definition

A Turing complete language is one that can perform any computation. The Church-Turing Thesis states that any performable computation can be done by a Turing machine. A Turing machine is a machine with infinite random access memory and a finite ‘program’ that dictates when it should read, write, and move across that memory, when it should terminate with a certain result, and what it should do next. The input to a Turing machine is put in its memory before it starts.

Things that can make a language NOT Turing complete

A Turing machine can make decisions based on what it sees in memory — The ‘language’ that only supports + , — , * , and / on integers is not Turing complete because it can’t make a choice based on its input, but a Turing machine can.

A Turing machine can run forever — If we took Java, Javascript, or Python and removed the ability to do any sort of loop, GOTO, or function call, it wouldn’t be Turing complete because it can’t perform an arbitrary computation that never finishes. Coq is a theorem prover that can’t express programs that don’t terminate, so it’s not Turing complete.

A Turing machine can use infinite memory — A language that was exactly like Java but would terminate once it used more than 4 Gigabytes of memory wouldn’t be Turing complete, because a Turing machine can use infinite memory. This is why we can’t actually build a Turing machine, but Java is still a Turing complete language because the Java language has no restriction preventing it from using infinite memory. This is one reason regular expressions aren’t Turing complete.

A Turing machine has random access memory — A language that only lets you work with memory through push and pop operations to a stack wouldn’t be Turing complete. If I have a ‘language’ that reads a string once and can only use memory by pushing and popping from a stack, it can tell me whether every ( in the string has its own ) later on by pushing when it sees ( and popping when it sees ) . However, it can’t tell me if every ( has its own ) later on and every [ has its own ] later on (note that ([)] meets this criteria but ([]] does not). A Turing machine can use its random access memory to track () ‘s and [] ‘s separately, but this language with only a stack cannot.

A Turing machine can simulate any other Turing machine — A Turing machine, when given an appropriate ‘program’, can take another Turing machine’s ‘program’ and simulate it on arbitrary input. If you had a language that was forbidden from implementing a Python interpreter, it wouldn’t be Turing complete.

Examples of Turing complete languages

If your language has infinite random access memory, conditional execution, and some form of repeated execution, it’s probably Turing complete. There are more exotic systems that can still achieve everything a Turing machine can, which makes them Turing complete too:

Игра в раннем доступе

Приобретите игру и начните играть — примите участие в ее развитии

Примечание: данная игра в раннем доступе находится на стадии разработки. Она может измениться в будущем, а может остаться в текущем состоянии, так что, если вам не по вкусу то, что игра может предложить сейчас, рекомендуем дождаться её дальнейшего развития. Узнать больше

Почему ранний доступ?

“Player feedback is crucial for puzzle games. Each level starts with an idea I want the player to realize on their own, but it takes a lot of trial and error to figure out how to get the difficulty of each level right.

As for the sandbox part of the game, I also want to experiment with what set of tools lets players get most creative.”

Сколько примерно эта игра будет в раннем доступе?

Чем планируемая полная версия будет отличаться от версии в раннем доступе?

Каково текущее состояние версии в раннем доступе?

Изменится ли цена игры после выхода из раннего доступа?

Как вы планируете вовлекать сообщество в разработку игры?

Этот продукт не поддерживает ваш язык. Пожалуйста, перед покупкой ознакомьтесь со списком поддерживаемых языков.

Купить Turing Complete

Сообщайте об ошибках и оставляйте отзывы в обсуждениях этой игры

Об этой игре

-= LEARN =-

Everything in a computer can be constructed from a basic component called a NAND gate. You will be challenged through a series of puzzles, to discover the path from NAND gates to arithmetic, memory and all the way to full CPU architectures. If you complete this game, you will have a deep understanding of how assembly, CPU instruction sets and basic components are related. And you will understand how programming concepts like if statements, loops and functions actually work in assembly and hardware.

-= BUILD =-

The game is built on a powerful simulator, that gives you total freedom in how you solve levels or create your own computers. Wire up screens, timers, sound, keyboard input and network components to create whatever you want. You can even design a unique assembly language for your computer.

Добавить комментарий

Ваш адрес email не будет опубликован. Обязательные поля помечены *