The first Turing machine











up vote
1
down vote

favorite












Does anyone know how efficient was the first Turing machine that Alan Turing made? I mean how many moves did it do per second or so... I'm just curious. Also couldn't find any info about it on the web.










share|cite|improve this question







New contributor




Pilpel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
























    up vote
    1
    down vote

    favorite












    Does anyone know how efficient was the first Turing machine that Alan Turing made? I mean how many moves did it do per second or so... I'm just curious. Also couldn't find any info about it on the web.










    share|cite|improve this question







    New contributor




    Pilpel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.






















      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      Does anyone know how efficient was the first Turing machine that Alan Turing made? I mean how many moves did it do per second or so... I'm just curious. Also couldn't find any info about it on the web.










      share|cite|improve this question







      New contributor




      Pilpel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      Does anyone know how efficient was the first Turing machine that Alan Turing made? I mean how many moves did it do per second or so... I'm just curious. Also couldn't find any info about it on the web.







      turing-machines






      share|cite|improve this question







      New contributor




      Pilpel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|cite|improve this question







      New contributor




      Pilpel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|cite|improve this question




      share|cite|improve this question






      New contributor




      Pilpel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 4 hours ago









      Pilpel

      1061




      1061




      New contributor




      Pilpel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Pilpel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Pilpel is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






















          4 Answers
          4






          active

          oldest

          votes

















          up vote
          1
          down vote













          Turing never built a physical Turing machine. The point of Turing machines was not to be a practical physical computer but to formalize what it's possible to compute and, indeed, to formalize what "computation" even means.






          share|cite|improve this answer




























            up vote
            1
            down vote













            "Turing machines" (or "a-machines") are a mathematical concept, not actual, physical devices. Turing came up with them in order to write mathematical proofs about computers, with the following logic:




            • Writing proofs about physical wires and switches is extremely difficult.

            • Writing proofs about Turing machines is (relatively) easy.

            • Anything physical wires and switches can do, you can build a Turing machine to do (*).


            But Turing never built an actual machine that wrote symbols on a paper tape. Other people have, but only as a demonstration: here's one you can make out of a business card, for example.



            Why did he never build a physical Turing machine? To put it simply, it just wouldn't be that useful. The thing is, nobody's ever come up with a model of computation that's stronger than a Turing machine (in that it can compute things a Turing machine can't). And it's been proven that several other models of computation, such as the lambda calculus or the Python programming language, are "Turing-complete": they can do everything a Turing machine can.



            So for anything except a mathematical proof, it's generally much more useful to use one of these other models. Then you can use the Turing machines in your proofs without any loss of generality.



            (*) Specifically, any calculation: a Turing machine can't turn on a lightbulb, for example, but lightbulbs aren't very interesting from a theory-of-computation standpoint.






            share|cite|improve this answer




























              up vote
              0
              down vote













              The TM only exists on paper. It is a theoretical model of computation. It actually can't be built (because the tape is infinitely long).



              So, the answer is: no, Turing never built a TM in real life, because he can't.






              share|cite|improve this answer





















              • What did he build then? I thought we define that tape to be infinitely long because in practice we could have a really long one so it's not a limitation)
                – Pilpel
                4 hours ago










              • It's perfectly possible to build a Turing machine. The tape doesn't need to be infinitely long: you just need to add some more every time the machine reaches the end.
                – David Richerby
                4 hours ago










              • @DavidRicherby Rather I should say that there are TMs which can't possibly be built, e.g. a TM that moves its head right at each step. This will require literally infinite tape.
                – xuq01
                3 hours ago










              • @Pilpel I don't think he actually built anything. Turing was a pure mathematician and worked solely on paper.
                – xuq01
                3 hours ago


















              up vote
              0
              down vote













              This is not exactly an answer to the question. However, I cannot help making some serious fun.



              Claim One: Lots of Turing machines have been built, by Alan Turing or by many others.

              Proof. I am sure Alan Turing might have pointed to a piece of junk and said, "look, this is a Turing machine that just halt at its very first step given any input". Me too.



              Claim Two: It is undecidable whether someone has built a Turing machine with unbounded tape.

              Proof. Here I claim that I have built one. However, to show each additional bit of its tape, it will take another day. Even I am not certain whether I have built a Turing machine or not.






              share|cite|improve this answer





















                Your Answer





                StackExchange.ifUsing("editor", function () {
                return StackExchange.using("mathjaxEditing", function () {
                StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
                StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
                });
                });
                }, "mathjax-editing");

                StackExchange.ready(function() {
                var channelOptions = {
                tags: "".split(" "),
                id: "419"
                };
                initTagRenderer("".split(" "), "".split(" "), channelOptions);

                StackExchange.using("externalEditor", function() {
                // Have to fire editor after snippets, if snippets enabled
                if (StackExchange.settings.snippets.snippetsEnabled) {
                StackExchange.using("snippets", function() {
                createEditor();
                });
                }
                else {
                createEditor();
                }
                });

                function createEditor() {
                StackExchange.prepareEditor({
                heartbeatType: 'answer',
                autoActivateHeartbeat: false,
                convertImagesToLinks: false,
                noModals: true,
                showLowRepImageUploadWarning: true,
                reputationToPostImages: null,
                bindNavPrevention: true,
                postfix: "",
                imageUploader: {
                brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
                contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
                allowUrls: true
                },
                onDemand: true,
                discardSelector: ".discard-answer"
                ,immediatelyShowMarkdownHelp:true
                });


                }
                });






                Pilpel is a new contributor. Be nice, and check out our Code of Conduct.










                draft saved

                draft discarded


















                StackExchange.ready(
                function () {
                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f101812%2fthe-first-turing-machine%23new-answer', 'question_page');
                }
                );

                Post as a guest















                Required, but never shown

























                4 Answers
                4






                active

                oldest

                votes








                4 Answers
                4






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes








                up vote
                1
                down vote













                Turing never built a physical Turing machine. The point of Turing machines was not to be a practical physical computer but to formalize what it's possible to compute and, indeed, to formalize what "computation" even means.






                share|cite|improve this answer

























                  up vote
                  1
                  down vote













                  Turing never built a physical Turing machine. The point of Turing machines was not to be a practical physical computer but to formalize what it's possible to compute and, indeed, to formalize what "computation" even means.






                  share|cite|improve this answer























                    up vote
                    1
                    down vote










                    up vote
                    1
                    down vote









                    Turing never built a physical Turing machine. The point of Turing machines was not to be a practical physical computer but to formalize what it's possible to compute and, indeed, to formalize what "computation" even means.






                    share|cite|improve this answer












                    Turing never built a physical Turing machine. The point of Turing machines was not to be a practical physical computer but to formalize what it's possible to compute and, indeed, to formalize what "computation" even means.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered 4 hours ago









                    David Richerby

                    65.6k1599188




                    65.6k1599188






















                        up vote
                        1
                        down vote













                        "Turing machines" (or "a-machines") are a mathematical concept, not actual, physical devices. Turing came up with them in order to write mathematical proofs about computers, with the following logic:




                        • Writing proofs about physical wires and switches is extremely difficult.

                        • Writing proofs about Turing machines is (relatively) easy.

                        • Anything physical wires and switches can do, you can build a Turing machine to do (*).


                        But Turing never built an actual machine that wrote symbols on a paper tape. Other people have, but only as a demonstration: here's one you can make out of a business card, for example.



                        Why did he never build a physical Turing machine? To put it simply, it just wouldn't be that useful. The thing is, nobody's ever come up with a model of computation that's stronger than a Turing machine (in that it can compute things a Turing machine can't). And it's been proven that several other models of computation, such as the lambda calculus or the Python programming language, are "Turing-complete": they can do everything a Turing machine can.



                        So for anything except a mathematical proof, it's generally much more useful to use one of these other models. Then you can use the Turing machines in your proofs without any loss of generality.



                        (*) Specifically, any calculation: a Turing machine can't turn on a lightbulb, for example, but lightbulbs aren't very interesting from a theory-of-computation standpoint.






                        share|cite|improve this answer

























                          up vote
                          1
                          down vote













                          "Turing machines" (or "a-machines") are a mathematical concept, not actual, physical devices. Turing came up with them in order to write mathematical proofs about computers, with the following logic:




                          • Writing proofs about physical wires and switches is extremely difficult.

                          • Writing proofs about Turing machines is (relatively) easy.

                          • Anything physical wires and switches can do, you can build a Turing machine to do (*).


                          But Turing never built an actual machine that wrote symbols on a paper tape. Other people have, but only as a demonstration: here's one you can make out of a business card, for example.



                          Why did he never build a physical Turing machine? To put it simply, it just wouldn't be that useful. The thing is, nobody's ever come up with a model of computation that's stronger than a Turing machine (in that it can compute things a Turing machine can't). And it's been proven that several other models of computation, such as the lambda calculus or the Python programming language, are "Turing-complete": they can do everything a Turing machine can.



                          So for anything except a mathematical proof, it's generally much more useful to use one of these other models. Then you can use the Turing machines in your proofs without any loss of generality.



                          (*) Specifically, any calculation: a Turing machine can't turn on a lightbulb, for example, but lightbulbs aren't very interesting from a theory-of-computation standpoint.






                          share|cite|improve this answer























                            up vote
                            1
                            down vote










                            up vote
                            1
                            down vote









                            "Turing machines" (or "a-machines") are a mathematical concept, not actual, physical devices. Turing came up with them in order to write mathematical proofs about computers, with the following logic:




                            • Writing proofs about physical wires and switches is extremely difficult.

                            • Writing proofs about Turing machines is (relatively) easy.

                            • Anything physical wires and switches can do, you can build a Turing machine to do (*).


                            But Turing never built an actual machine that wrote symbols on a paper tape. Other people have, but only as a demonstration: here's one you can make out of a business card, for example.



                            Why did he never build a physical Turing machine? To put it simply, it just wouldn't be that useful. The thing is, nobody's ever come up with a model of computation that's stronger than a Turing machine (in that it can compute things a Turing machine can't). And it's been proven that several other models of computation, such as the lambda calculus or the Python programming language, are "Turing-complete": they can do everything a Turing machine can.



                            So for anything except a mathematical proof, it's generally much more useful to use one of these other models. Then you can use the Turing machines in your proofs without any loss of generality.



                            (*) Specifically, any calculation: a Turing machine can't turn on a lightbulb, for example, but lightbulbs aren't very interesting from a theory-of-computation standpoint.






                            share|cite|improve this answer












                            "Turing machines" (or "a-machines") are a mathematical concept, not actual, physical devices. Turing came up with them in order to write mathematical proofs about computers, with the following logic:




                            • Writing proofs about physical wires and switches is extremely difficult.

                            • Writing proofs about Turing machines is (relatively) easy.

                            • Anything physical wires and switches can do, you can build a Turing machine to do (*).


                            But Turing never built an actual machine that wrote symbols on a paper tape. Other people have, but only as a demonstration: here's one you can make out of a business card, for example.



                            Why did he never build a physical Turing machine? To put it simply, it just wouldn't be that useful. The thing is, nobody's ever come up with a model of computation that's stronger than a Turing machine (in that it can compute things a Turing machine can't). And it's been proven that several other models of computation, such as the lambda calculus or the Python programming language, are "Turing-complete": they can do everything a Turing machine can.



                            So for anything except a mathematical proof, it's generally much more useful to use one of these other models. Then you can use the Turing machines in your proofs without any loss of generality.



                            (*) Specifically, any calculation: a Turing machine can't turn on a lightbulb, for example, but lightbulbs aren't very interesting from a theory-of-computation standpoint.







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered 4 hours ago









                            Draconis

                            3,075514




                            3,075514






















                                up vote
                                0
                                down vote













                                The TM only exists on paper. It is a theoretical model of computation. It actually can't be built (because the tape is infinitely long).



                                So, the answer is: no, Turing never built a TM in real life, because he can't.






                                share|cite|improve this answer





















                                • What did he build then? I thought we define that tape to be infinitely long because in practice we could have a really long one so it's not a limitation)
                                  – Pilpel
                                  4 hours ago










                                • It's perfectly possible to build a Turing machine. The tape doesn't need to be infinitely long: you just need to add some more every time the machine reaches the end.
                                  – David Richerby
                                  4 hours ago










                                • @DavidRicherby Rather I should say that there are TMs which can't possibly be built, e.g. a TM that moves its head right at each step. This will require literally infinite tape.
                                  – xuq01
                                  3 hours ago










                                • @Pilpel I don't think he actually built anything. Turing was a pure mathematician and worked solely on paper.
                                  – xuq01
                                  3 hours ago















                                up vote
                                0
                                down vote













                                The TM only exists on paper. It is a theoretical model of computation. It actually can't be built (because the tape is infinitely long).



                                So, the answer is: no, Turing never built a TM in real life, because he can't.






                                share|cite|improve this answer





















                                • What did he build then? I thought we define that tape to be infinitely long because in practice we could have a really long one so it's not a limitation)
                                  – Pilpel
                                  4 hours ago










                                • It's perfectly possible to build a Turing machine. The tape doesn't need to be infinitely long: you just need to add some more every time the machine reaches the end.
                                  – David Richerby
                                  4 hours ago










                                • @DavidRicherby Rather I should say that there are TMs which can't possibly be built, e.g. a TM that moves its head right at each step. This will require literally infinite tape.
                                  – xuq01
                                  3 hours ago










                                • @Pilpel I don't think he actually built anything. Turing was a pure mathematician and worked solely on paper.
                                  – xuq01
                                  3 hours ago













                                up vote
                                0
                                down vote










                                up vote
                                0
                                down vote









                                The TM only exists on paper. It is a theoretical model of computation. It actually can't be built (because the tape is infinitely long).



                                So, the answer is: no, Turing never built a TM in real life, because he can't.






                                share|cite|improve this answer












                                The TM only exists on paper. It is a theoretical model of computation. It actually can't be built (because the tape is infinitely long).



                                So, the answer is: no, Turing never built a TM in real life, because he can't.







                                share|cite|improve this answer












                                share|cite|improve this answer



                                share|cite|improve this answer










                                answered 4 hours ago









                                xuq01

                                947513




                                947513












                                • What did he build then? I thought we define that tape to be infinitely long because in practice we could have a really long one so it's not a limitation)
                                  – Pilpel
                                  4 hours ago










                                • It's perfectly possible to build a Turing machine. The tape doesn't need to be infinitely long: you just need to add some more every time the machine reaches the end.
                                  – David Richerby
                                  4 hours ago










                                • @DavidRicherby Rather I should say that there are TMs which can't possibly be built, e.g. a TM that moves its head right at each step. This will require literally infinite tape.
                                  – xuq01
                                  3 hours ago










                                • @Pilpel I don't think he actually built anything. Turing was a pure mathematician and worked solely on paper.
                                  – xuq01
                                  3 hours ago


















                                • What did he build then? I thought we define that tape to be infinitely long because in practice we could have a really long one so it's not a limitation)
                                  – Pilpel
                                  4 hours ago










                                • It's perfectly possible to build a Turing machine. The tape doesn't need to be infinitely long: you just need to add some more every time the machine reaches the end.
                                  – David Richerby
                                  4 hours ago










                                • @DavidRicherby Rather I should say that there are TMs which can't possibly be built, e.g. a TM that moves its head right at each step. This will require literally infinite tape.
                                  – xuq01
                                  3 hours ago










                                • @Pilpel I don't think he actually built anything. Turing was a pure mathematician and worked solely on paper.
                                  – xuq01
                                  3 hours ago
















                                What did he build then? I thought we define that tape to be infinitely long because in practice we could have a really long one so it's not a limitation)
                                – Pilpel
                                4 hours ago




                                What did he build then? I thought we define that tape to be infinitely long because in practice we could have a really long one so it's not a limitation)
                                – Pilpel
                                4 hours ago












                                It's perfectly possible to build a Turing machine. The tape doesn't need to be infinitely long: you just need to add some more every time the machine reaches the end.
                                – David Richerby
                                4 hours ago




                                It's perfectly possible to build a Turing machine. The tape doesn't need to be infinitely long: you just need to add some more every time the machine reaches the end.
                                – David Richerby
                                4 hours ago












                                @DavidRicherby Rather I should say that there are TMs which can't possibly be built, e.g. a TM that moves its head right at each step. This will require literally infinite tape.
                                – xuq01
                                3 hours ago




                                @DavidRicherby Rather I should say that there are TMs which can't possibly be built, e.g. a TM that moves its head right at each step. This will require literally infinite tape.
                                – xuq01
                                3 hours ago












                                @Pilpel I don't think he actually built anything. Turing was a pure mathematician and worked solely on paper.
                                – xuq01
                                3 hours ago




                                @Pilpel I don't think he actually built anything. Turing was a pure mathematician and worked solely on paper.
                                – xuq01
                                3 hours ago










                                up vote
                                0
                                down vote













                                This is not exactly an answer to the question. However, I cannot help making some serious fun.



                                Claim One: Lots of Turing machines have been built, by Alan Turing or by many others.

                                Proof. I am sure Alan Turing might have pointed to a piece of junk and said, "look, this is a Turing machine that just halt at its very first step given any input". Me too.



                                Claim Two: It is undecidable whether someone has built a Turing machine with unbounded tape.

                                Proof. Here I claim that I have built one. However, to show each additional bit of its tape, it will take another day. Even I am not certain whether I have built a Turing machine or not.






                                share|cite|improve this answer

























                                  up vote
                                  0
                                  down vote













                                  This is not exactly an answer to the question. However, I cannot help making some serious fun.



                                  Claim One: Lots of Turing machines have been built, by Alan Turing or by many others.

                                  Proof. I am sure Alan Turing might have pointed to a piece of junk and said, "look, this is a Turing machine that just halt at its very first step given any input". Me too.



                                  Claim Two: It is undecidable whether someone has built a Turing machine with unbounded tape.

                                  Proof. Here I claim that I have built one. However, to show each additional bit of its tape, it will take another day. Even I am not certain whether I have built a Turing machine or not.






                                  share|cite|improve this answer























                                    up vote
                                    0
                                    down vote










                                    up vote
                                    0
                                    down vote









                                    This is not exactly an answer to the question. However, I cannot help making some serious fun.



                                    Claim One: Lots of Turing machines have been built, by Alan Turing or by many others.

                                    Proof. I am sure Alan Turing might have pointed to a piece of junk and said, "look, this is a Turing machine that just halt at its very first step given any input". Me too.



                                    Claim Two: It is undecidable whether someone has built a Turing machine with unbounded tape.

                                    Proof. Here I claim that I have built one. However, to show each additional bit of its tape, it will take another day. Even I am not certain whether I have built a Turing machine or not.






                                    share|cite|improve this answer












                                    This is not exactly an answer to the question. However, I cannot help making some serious fun.



                                    Claim One: Lots of Turing machines have been built, by Alan Turing or by many others.

                                    Proof. I am sure Alan Turing might have pointed to a piece of junk and said, "look, this is a Turing machine that just halt at its very first step given any input". Me too.



                                    Claim Two: It is undecidable whether someone has built a Turing machine with unbounded tape.

                                    Proof. Here I claim that I have built one. However, to show each additional bit of its tape, it will take another day. Even I am not certain whether I have built a Turing machine or not.







                                    share|cite|improve this answer












                                    share|cite|improve this answer



                                    share|cite|improve this answer










                                    answered 3 hours ago









                                    Apass.Jack

                                    6,3301532




                                    6,3301532






















                                        Pilpel is a new contributor. Be nice, and check out our Code of Conduct.










                                        draft saved

                                        draft discarded


















                                        Pilpel is a new contributor. Be nice, and check out our Code of Conduct.













                                        Pilpel is a new contributor. Be nice, and check out our Code of Conduct.












                                        Pilpel is a new contributor. Be nice, and check out our Code of Conduct.
















                                        Thanks for contributing an answer to Computer Science Stack Exchange!


                                        • Please be sure to answer the question. Provide details and share your research!

                                        But avoid



                                        • Asking for help, clarification, or responding to other answers.

                                        • Making statements based on opinion; back them up with references or personal experience.


                                        Use MathJax to format equations. MathJax reference.


                                        To learn more, see our tips on writing great answers.





                                        Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                                        Please pay close attention to the following guidance:


                                        • Please be sure to answer the question. Provide details and share your research!

                                        But avoid



                                        • Asking for help, clarification, or responding to other answers.

                                        • Making statements based on opinion; back them up with references or personal experience.


                                        To learn more, see our tips on writing great answers.




                                        draft saved


                                        draft discarded














                                        StackExchange.ready(
                                        function () {
                                        StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f101812%2fthe-first-turing-machine%23new-answer', 'question_page');
                                        }
                                        );

                                        Post as a guest















                                        Required, but never shown





















































                                        Required, but never shown














                                        Required, but never shown












                                        Required, but never shown







                                        Required, but never shown

































                                        Required, but never shown














                                        Required, but never shown












                                        Required, but never shown







                                        Required, but never shown







                                        Popular posts from this blog

                                        サソリ

                                        広島県道265号伴広島線

                                        Setup Asymptote in Texstudio