![nature01255-i1.0[1].jpg](https://i.imgur.com/XDWEEyc.jpg "nature01255-i1.0[1].jpg")
What kind of automaton do modern computers resemble the most?
>>51869661
You might do better to ask on one of the generals, maybe /dpt/. Or just skip the memery entirely and ask /sci/
A computer is just a turing machine
go back to school kiddo
what, you expect /g/ to do something other than circlejerk over $800 phones?
>>51870112
*with limited memory
>>51870115
This is no discussion topic desu - he askss a question any undergrad CS can answer. This aint no wiki mate.
From Wikipedia:
>While they can express arbitrary computations, their minimalistic design makes them unsuitable for computation in practice: actual computers are based on different designs that, unlike Turing machines, use random access memory.
>>51870377
What makes them a bit faster, but the kind of problems (as long as the size of the memory is sufficient) they can solve stay the same.
>>51870427
If some machine can run Turing-complete instructions, is it a Turning machine? I don't think it's necessarily the case.
>>51870537
If a machine is turning complete, it is a turning machine.
>>51870661
Please elaborate.
>>51870537
If you can use it to write a Turing machine, and write a Turing machine to interpret its programs, it's called Turing-equivalent, which is the normal definition of "sameness". You can always extend the concept of Turing machines to get something computationally stronger, though (e.g. with oracle machines or Turing machines that are allowed to run in an infinite ordinal number of steps). These machines will always satisfy the first implication, but not the second. This is called Turing-completeness.
In the physical world of actual computers, we only care about showing Turing-completeness, because we've never been able to construct a physical machine that is stronger than a Turing machine (so completeness implies equivalence).
>>51869661
Requesting source on pic.
>>51870215
This.
Given an input and an infinite amount of time, it will return an output, as long as the input is readable by it.
The base language you input to the machine is turing-complete, so as long as your inputs can be translated to its base language, it can execute the instructions.
