How can a computer run an infinite loop?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
3
down vote

favorite
3












I understand the concept behind for and do/while loops, but I am trying to understand what is happening at the hardware level that allows a loop to run infinitely. Technically wouldn't it have to stop at some point because there are only a couple billion transistors in a microprocessor? Maybe my logic is off.










share|cite|improve this question



















  • 3




    A mechanical counter can only memorize a few digits, but it can loop forever. After 9999, we restart from 0000. Your argument only proves that in an infinite computation, the processor will eventually visit the same state twice, entering a loop.
    – chi
    2 days ago






  • 2




    See this comment.
    – philipxy
    2 days ago







  • 5




    "only a couple billion transistors". The same transistors get used over and over while the processor is running.
    – Barmar
    2 days ago






  • 8




    A running track has a finite size, but you can run around it as many times as you like.
    – Barmar
    2 days ago














up vote
3
down vote

favorite
3












I understand the concept behind for and do/while loops, but I am trying to understand what is happening at the hardware level that allows a loop to run infinitely. Technically wouldn't it have to stop at some point because there are only a couple billion transistors in a microprocessor? Maybe my logic is off.










share|cite|improve this question



















  • 3




    A mechanical counter can only memorize a few digits, but it can loop forever. After 9999, we restart from 0000. Your argument only proves that in an infinite computation, the processor will eventually visit the same state twice, entering a loop.
    – chi
    2 days ago






  • 2




    See this comment.
    – philipxy
    2 days ago







  • 5




    "only a couple billion transistors". The same transistors get used over and over while the processor is running.
    – Barmar
    2 days ago






  • 8




    A running track has a finite size, but you can run around it as many times as you like.
    – Barmar
    2 days ago












up vote
3
down vote

favorite
3









up vote
3
down vote

favorite
3






3





I understand the concept behind for and do/while loops, but I am trying to understand what is happening at the hardware level that allows a loop to run infinitely. Technically wouldn't it have to stop at some point because there are only a couple billion transistors in a microprocessor? Maybe my logic is off.










share|cite|improve this question















I understand the concept behind for and do/while loops, but I am trying to understand what is happening at the hardware level that allows a loop to run infinitely. Technically wouldn't it have to stop at some point because there are only a couple billion transistors in a microprocessor? Maybe my logic is off.







loops control-flow






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 5 hours ago









Bergi

34519




34519










asked 2 days ago









Cody Rutscher

328




328







  • 3




    A mechanical counter can only memorize a few digits, but it can loop forever. After 9999, we restart from 0000. Your argument only proves that in an infinite computation, the processor will eventually visit the same state twice, entering a loop.
    – chi
    2 days ago






  • 2




    See this comment.
    – philipxy
    2 days ago







  • 5




    "only a couple billion transistors". The same transistors get used over and over while the processor is running.
    – Barmar
    2 days ago






  • 8




    A running track has a finite size, but you can run around it as many times as you like.
    – Barmar
    2 days ago












  • 3




    A mechanical counter can only memorize a few digits, but it can loop forever. After 9999, we restart from 0000. Your argument only proves that in an infinite computation, the processor will eventually visit the same state twice, entering a loop.
    – chi
    2 days ago






  • 2




    See this comment.
    – philipxy
    2 days ago







  • 5




    "only a couple billion transistors". The same transistors get used over and over while the processor is running.
    – Barmar
    2 days ago






  • 8




    A running track has a finite size, but you can run around it as many times as you like.
    – Barmar
    2 days ago







3




3




A mechanical counter can only memorize a few digits, but it can loop forever. After 9999, we restart from 0000. Your argument only proves that in an infinite computation, the processor will eventually visit the same state twice, entering a loop.
– chi
2 days ago




A mechanical counter can only memorize a few digits, but it can loop forever. After 9999, we restart from 0000. Your argument only proves that in an infinite computation, the processor will eventually visit the same state twice, entering a loop.
– chi
2 days ago




2




2




See this comment.
– philipxy
2 days ago





See this comment.
– philipxy
2 days ago





5




5




"only a couple billion transistors". The same transistors get used over and over while the processor is running.
– Barmar
2 days ago




"only a couple billion transistors". The same transistors get used over and over while the processor is running.
– Barmar
2 days ago




8




8




A running track has a finite size, but you can run around it as many times as you like.
– Barmar
2 days ago




A running track has a finite size, but you can run around it as many times as you like.
– Barmar
2 days ago










5 Answers
5






active

oldest

votes

















up vote
23
down vote



accepted










step 1: take a calculator



step 2: input a number



step 3: add 1 to the number



step 4: subtract 1 from the number



step 5: goto step 3



If you didn't eventually get tired or bored you would be switching between the 2 results forever. Computers don't get tired or bored.






share|cite|improve this answer
















  • 2




    Good answer, but it leaves out an important word that appears in some of the others: That is, "state." Your answer illustrates the fact that even though a real computer can only have a finite number of possible states, nothing prevents it from cycling through some subset of those states, over and over again forever.
    – Solomon Slow
    5 hours ago


















up vote
27
down vote













In a contemporary processor there is, among many other things, a register (digital electronic component to hold some bits) called the Program Counter (PC). It holds the memory address to the current machine instruction.



During normal flow of the program, the PC will always be updated to address the next instruction. However, any loop will be implemented with so called branch or jump type instructions which will cause the PC to address some other instruction, rather than the next one.



One, if not the, simplest infinite loop, is one in which the PC is updated again to the same instruction.



An assembly (MIPS) code example (beq stands for Branch on Equal):



LABEL: beq $0, $0, LABEL # Comment: If 0 == 0,then goto LABEL.





share|cite|improve this answer










New contributor




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
























    up vote
    5
    down vote













    At the most basic level, an "infinite loop" only requires two transistors — an astable multivibrator will alternate between two different digital states indefinitely as long as it has power. In some sense, every other loop is just a bigger version of this. You don't need more and more transistors to keep operating for a longer period of time.



    But what you might notice is that the astable multivibrator only has two states. Q is on, then Q is off, then Q is on again. It can only do two things before it repeats. There isn't really anywhere else for it to go. This is a general limitation: a system with a finite state can only go through a finite number of states before it repeats. The more transistors you have, the more "interesting stuff" you can do in your infinite loop. But with "only a couple billion" transistors there are trillions of possible combinations, which is quite a lot. And that's not even counting the RAM, which adds more billions (or even a trillion) more bits of state, making the number of possible states that the system can be in truly massive. As such, it's possible (even fairly easy) to write a program that, e.g. generates prime numbers, and keeps running for longer than the probable lifetime of the hardware (or even the solar system), without running out of different possible combinations of on/off transistors.






    share|cite|improve this answer



























      up vote
      3
      down vote













      You only need two transistors for that, as demonstrated by the old joke.



      How do you keep a (insert ethnicity here) busy forever?



      Write "Please turn over" on both sides of a sheet of paper.



      It's as true for transistors as for humans. In this case, two transistors make a bistable oscillator, and they'll toggle between true and false for as long as there's power there.






      share|cite|improve this answer



























        up vote
        1
        down vote













        One thing other answers have missed is that CPUs have a clock source, an external device (usually a quartz crystal oscillator) which switches from 0 to 1 and back a fixed number of times a second. This clock signal is what makes the CPU go from one instruction to the next. If the clock signal is too fast, the transistors that "perform" the instruction haven't finished charging up and so the results are garbled.



        Modern CPUs do very complicated things for performance reasons but this is the basic idea.



        Maybe that is enough to understand how the CPU moves from one thing to another thing and then moves back to the beginning. But I will go into a bit more detail.



        Inside the CPU are memory cells using a fixed number of transistors which can be overwritten with new values. There is also a fixed number of transistors that perform various computations, like addition, comparison, and so on. The clock opens the gate to allow data to "flow" from the memory cells, through the "compute" portion, and then the result is allowed back into the memory cells.



        So if your instructions are as follows:



        1. x = 5
        2. y = x + 1
        3. Go to step 1


        the processor will end up in exactly the same state when it starts each loop. (Well, in theory.)






        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',
          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
          );



          );













           

          draft saved


          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f99806%2fhow-can-a-computer-run-an-infinite-loop%23new-answer', 'question_page');

          );

          Post as a guest






























          5 Answers
          5






          active

          oldest

          votes








          5 Answers
          5






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          23
          down vote



          accepted










          step 1: take a calculator



          step 2: input a number



          step 3: add 1 to the number



          step 4: subtract 1 from the number



          step 5: goto step 3



          If you didn't eventually get tired or bored you would be switching between the 2 results forever. Computers don't get tired or bored.






          share|cite|improve this answer
















          • 2




            Good answer, but it leaves out an important word that appears in some of the others: That is, "state." Your answer illustrates the fact that even though a real computer can only have a finite number of possible states, nothing prevents it from cycling through some subset of those states, over and over again forever.
            – Solomon Slow
            5 hours ago















          up vote
          23
          down vote



          accepted










          step 1: take a calculator



          step 2: input a number



          step 3: add 1 to the number



          step 4: subtract 1 from the number



          step 5: goto step 3



          If you didn't eventually get tired or bored you would be switching between the 2 results forever. Computers don't get tired or bored.






          share|cite|improve this answer
















          • 2




            Good answer, but it leaves out an important word that appears in some of the others: That is, "state." Your answer illustrates the fact that even though a real computer can only have a finite number of possible states, nothing prevents it from cycling through some subset of those states, over and over again forever.
            – Solomon Slow
            5 hours ago













          up vote
          23
          down vote



          accepted







          up vote
          23
          down vote



          accepted






          step 1: take a calculator



          step 2: input a number



          step 3: add 1 to the number



          step 4: subtract 1 from the number



          step 5: goto step 3



          If you didn't eventually get tired or bored you would be switching between the 2 results forever. Computers don't get tired or bored.






          share|cite|improve this answer












          step 1: take a calculator



          step 2: input a number



          step 3: add 1 to the number



          step 4: subtract 1 from the number



          step 5: goto step 3



          If you didn't eventually get tired or bored you would be switching between the 2 results forever. Computers don't get tired or bored.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 2 days ago









          ratchet freak

          2,48078




          2,48078







          • 2




            Good answer, but it leaves out an important word that appears in some of the others: That is, "state." Your answer illustrates the fact that even though a real computer can only have a finite number of possible states, nothing prevents it from cycling through some subset of those states, over and over again forever.
            – Solomon Slow
            5 hours ago













          • 2




            Good answer, but it leaves out an important word that appears in some of the others: That is, "state." Your answer illustrates the fact that even though a real computer can only have a finite number of possible states, nothing prevents it from cycling through some subset of those states, over and over again forever.
            – Solomon Slow
            5 hours ago








          2




          2




          Good answer, but it leaves out an important word that appears in some of the others: That is, "state." Your answer illustrates the fact that even though a real computer can only have a finite number of possible states, nothing prevents it from cycling through some subset of those states, over and over again forever.
          – Solomon Slow
          5 hours ago





          Good answer, but it leaves out an important word that appears in some of the others: That is, "state." Your answer illustrates the fact that even though a real computer can only have a finite number of possible states, nothing prevents it from cycling through some subset of those states, over and over again forever.
          – Solomon Slow
          5 hours ago











          up vote
          27
          down vote













          In a contemporary processor there is, among many other things, a register (digital electronic component to hold some bits) called the Program Counter (PC). It holds the memory address to the current machine instruction.



          During normal flow of the program, the PC will always be updated to address the next instruction. However, any loop will be implemented with so called branch or jump type instructions which will cause the PC to address some other instruction, rather than the next one.



          One, if not the, simplest infinite loop, is one in which the PC is updated again to the same instruction.



          An assembly (MIPS) code example (beq stands for Branch on Equal):



          LABEL: beq $0, $0, LABEL # Comment: If 0 == 0,then goto LABEL.





          share|cite|improve this answer










          New contributor




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





















            up vote
            27
            down vote













            In a contemporary processor there is, among many other things, a register (digital electronic component to hold some bits) called the Program Counter (PC). It holds the memory address to the current machine instruction.



            During normal flow of the program, the PC will always be updated to address the next instruction. However, any loop will be implemented with so called branch or jump type instructions which will cause the PC to address some other instruction, rather than the next one.



            One, if not the, simplest infinite loop, is one in which the PC is updated again to the same instruction.



            An assembly (MIPS) code example (beq stands for Branch on Equal):



            LABEL: beq $0, $0, LABEL # Comment: If 0 == 0,then goto LABEL.





            share|cite|improve this answer










            New contributor




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



















              up vote
              27
              down vote










              up vote
              27
              down vote









              In a contemporary processor there is, among many other things, a register (digital electronic component to hold some bits) called the Program Counter (PC). It holds the memory address to the current machine instruction.



              During normal flow of the program, the PC will always be updated to address the next instruction. However, any loop will be implemented with so called branch or jump type instructions which will cause the PC to address some other instruction, rather than the next one.



              One, if not the, simplest infinite loop, is one in which the PC is updated again to the same instruction.



              An assembly (MIPS) code example (beq stands for Branch on Equal):



              LABEL: beq $0, $0, LABEL # Comment: If 0 == 0,then goto LABEL.





              share|cite|improve this answer










              New contributor




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









              In a contemporary processor there is, among many other things, a register (digital electronic component to hold some bits) called the Program Counter (PC). It holds the memory address to the current machine instruction.



              During normal flow of the program, the PC will always be updated to address the next instruction. However, any loop will be implemented with so called branch or jump type instructions which will cause the PC to address some other instruction, rather than the next one.



              One, if not the, simplest infinite loop, is one in which the PC is updated again to the same instruction.



              An assembly (MIPS) code example (beq stands for Branch on Equal):



              LABEL: beq $0, $0, LABEL # Comment: If 0 == 0,then goto LABEL.






              share|cite|improve this answer










              New contributor




              Klorax 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 answer



              share|cite|improve this answer








              edited 2 days ago





















              New contributor




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









              answered 2 days ago









              Klorax

              38117




              38117




              New contributor




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





              New contributor





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






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




















                  up vote
                  5
                  down vote













                  At the most basic level, an "infinite loop" only requires two transistors — an astable multivibrator will alternate between two different digital states indefinitely as long as it has power. In some sense, every other loop is just a bigger version of this. You don't need more and more transistors to keep operating for a longer period of time.



                  But what you might notice is that the astable multivibrator only has two states. Q is on, then Q is off, then Q is on again. It can only do two things before it repeats. There isn't really anywhere else for it to go. This is a general limitation: a system with a finite state can only go through a finite number of states before it repeats. The more transistors you have, the more "interesting stuff" you can do in your infinite loop. But with "only a couple billion" transistors there are trillions of possible combinations, which is quite a lot. And that's not even counting the RAM, which adds more billions (or even a trillion) more bits of state, making the number of possible states that the system can be in truly massive. As such, it's possible (even fairly easy) to write a program that, e.g. generates prime numbers, and keeps running for longer than the probable lifetime of the hardware (or even the solar system), without running out of different possible combinations of on/off transistors.






                  share|cite|improve this answer
























                    up vote
                    5
                    down vote













                    At the most basic level, an "infinite loop" only requires two transistors — an astable multivibrator will alternate between two different digital states indefinitely as long as it has power. In some sense, every other loop is just a bigger version of this. You don't need more and more transistors to keep operating for a longer period of time.



                    But what you might notice is that the astable multivibrator only has two states. Q is on, then Q is off, then Q is on again. It can only do two things before it repeats. There isn't really anywhere else for it to go. This is a general limitation: a system with a finite state can only go through a finite number of states before it repeats. The more transistors you have, the more "interesting stuff" you can do in your infinite loop. But with "only a couple billion" transistors there are trillions of possible combinations, which is quite a lot. And that's not even counting the RAM, which adds more billions (or even a trillion) more bits of state, making the number of possible states that the system can be in truly massive. As such, it's possible (even fairly easy) to write a program that, e.g. generates prime numbers, and keeps running for longer than the probable lifetime of the hardware (or even the solar system), without running out of different possible combinations of on/off transistors.






                    share|cite|improve this answer






















                      up vote
                      5
                      down vote










                      up vote
                      5
                      down vote









                      At the most basic level, an "infinite loop" only requires two transistors — an astable multivibrator will alternate between two different digital states indefinitely as long as it has power. In some sense, every other loop is just a bigger version of this. You don't need more and more transistors to keep operating for a longer period of time.



                      But what you might notice is that the astable multivibrator only has two states. Q is on, then Q is off, then Q is on again. It can only do two things before it repeats. There isn't really anywhere else for it to go. This is a general limitation: a system with a finite state can only go through a finite number of states before it repeats. The more transistors you have, the more "interesting stuff" you can do in your infinite loop. But with "only a couple billion" transistors there are trillions of possible combinations, which is quite a lot. And that's not even counting the RAM, which adds more billions (or even a trillion) more bits of state, making the number of possible states that the system can be in truly massive. As such, it's possible (even fairly easy) to write a program that, e.g. generates prime numbers, and keeps running for longer than the probable lifetime of the hardware (or even the solar system), without running out of different possible combinations of on/off transistors.






                      share|cite|improve this answer












                      At the most basic level, an "infinite loop" only requires two transistors — an astable multivibrator will alternate between two different digital states indefinitely as long as it has power. In some sense, every other loop is just a bigger version of this. You don't need more and more transistors to keep operating for a longer period of time.



                      But what you might notice is that the astable multivibrator only has two states. Q is on, then Q is off, then Q is on again. It can only do two things before it repeats. There isn't really anywhere else for it to go. This is a general limitation: a system with a finite state can only go through a finite number of states before it repeats. The more transistors you have, the more "interesting stuff" you can do in your infinite loop. But with "only a couple billion" transistors there are trillions of possible combinations, which is quite a lot. And that's not even counting the RAM, which adds more billions (or even a trillion) more bits of state, making the number of possible states that the system can be in truly massive. As such, it's possible (even fairly easy) to write a program that, e.g. generates prime numbers, and keeps running for longer than the probable lifetime of the hardware (or even the solar system), without running out of different possible combinations of on/off transistors.







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered 2 days ago









                      hobbs

                      21315




                      21315




















                          up vote
                          3
                          down vote













                          You only need two transistors for that, as demonstrated by the old joke.



                          How do you keep a (insert ethnicity here) busy forever?



                          Write "Please turn over" on both sides of a sheet of paper.



                          It's as true for transistors as for humans. In this case, two transistors make a bistable oscillator, and they'll toggle between true and false for as long as there's power there.






                          share|cite|improve this answer
























                            up vote
                            3
                            down vote













                            You only need two transistors for that, as demonstrated by the old joke.



                            How do you keep a (insert ethnicity here) busy forever?



                            Write "Please turn over" on both sides of a sheet of paper.



                            It's as true for transistors as for humans. In this case, two transistors make a bistable oscillator, and they'll toggle between true and false for as long as there's power there.






                            share|cite|improve this answer






















                              up vote
                              3
                              down vote










                              up vote
                              3
                              down vote









                              You only need two transistors for that, as demonstrated by the old joke.



                              How do you keep a (insert ethnicity here) busy forever?



                              Write "Please turn over" on both sides of a sheet of paper.



                              It's as true for transistors as for humans. In this case, two transistors make a bistable oscillator, and they'll toggle between true and false for as long as there's power there.






                              share|cite|improve this answer












                              You only need two transistors for that, as demonstrated by the old joke.



                              How do you keep a (insert ethnicity here) busy forever?



                              Write "Please turn over" on both sides of a sheet of paper.



                              It's as true for transistors as for humans. In this case, two transistors make a bistable oscillator, and they'll toggle between true and false for as long as there's power there.







                              share|cite|improve this answer












                              share|cite|improve this answer



                              share|cite|improve this answer










                              answered 2 days ago









                              Graham

                              1991




                              1991




















                                  up vote
                                  1
                                  down vote













                                  One thing other answers have missed is that CPUs have a clock source, an external device (usually a quartz crystal oscillator) which switches from 0 to 1 and back a fixed number of times a second. This clock signal is what makes the CPU go from one instruction to the next. If the clock signal is too fast, the transistors that "perform" the instruction haven't finished charging up and so the results are garbled.



                                  Modern CPUs do very complicated things for performance reasons but this is the basic idea.



                                  Maybe that is enough to understand how the CPU moves from one thing to another thing and then moves back to the beginning. But I will go into a bit more detail.



                                  Inside the CPU are memory cells using a fixed number of transistors which can be overwritten with new values. There is also a fixed number of transistors that perform various computations, like addition, comparison, and so on. The clock opens the gate to allow data to "flow" from the memory cells, through the "compute" portion, and then the result is allowed back into the memory cells.



                                  So if your instructions are as follows:



                                  1. x = 5
                                  2. y = x + 1
                                  3. Go to step 1


                                  the processor will end up in exactly the same state when it starts each loop. (Well, in theory.)






                                  share|cite|improve this answer
























                                    up vote
                                    1
                                    down vote













                                    One thing other answers have missed is that CPUs have a clock source, an external device (usually a quartz crystal oscillator) which switches from 0 to 1 and back a fixed number of times a second. This clock signal is what makes the CPU go from one instruction to the next. If the clock signal is too fast, the transistors that "perform" the instruction haven't finished charging up and so the results are garbled.



                                    Modern CPUs do very complicated things for performance reasons but this is the basic idea.



                                    Maybe that is enough to understand how the CPU moves from one thing to another thing and then moves back to the beginning. But I will go into a bit more detail.



                                    Inside the CPU are memory cells using a fixed number of transistors which can be overwritten with new values. There is also a fixed number of transistors that perform various computations, like addition, comparison, and so on. The clock opens the gate to allow data to "flow" from the memory cells, through the "compute" portion, and then the result is allowed back into the memory cells.



                                    So if your instructions are as follows:



                                    1. x = 5
                                    2. y = x + 1
                                    3. Go to step 1


                                    the processor will end up in exactly the same state when it starts each loop. (Well, in theory.)






                                    share|cite|improve this answer






















                                      up vote
                                      1
                                      down vote










                                      up vote
                                      1
                                      down vote









                                      One thing other answers have missed is that CPUs have a clock source, an external device (usually a quartz crystal oscillator) which switches from 0 to 1 and back a fixed number of times a second. This clock signal is what makes the CPU go from one instruction to the next. If the clock signal is too fast, the transistors that "perform" the instruction haven't finished charging up and so the results are garbled.



                                      Modern CPUs do very complicated things for performance reasons but this is the basic idea.



                                      Maybe that is enough to understand how the CPU moves from one thing to another thing and then moves back to the beginning. But I will go into a bit more detail.



                                      Inside the CPU are memory cells using a fixed number of transistors which can be overwritten with new values. There is also a fixed number of transistors that perform various computations, like addition, comparison, and so on. The clock opens the gate to allow data to "flow" from the memory cells, through the "compute" portion, and then the result is allowed back into the memory cells.



                                      So if your instructions are as follows:



                                      1. x = 5
                                      2. y = x + 1
                                      3. Go to step 1


                                      the processor will end up in exactly the same state when it starts each loop. (Well, in theory.)






                                      share|cite|improve this answer












                                      One thing other answers have missed is that CPUs have a clock source, an external device (usually a quartz crystal oscillator) which switches from 0 to 1 and back a fixed number of times a second. This clock signal is what makes the CPU go from one instruction to the next. If the clock signal is too fast, the transistors that "perform" the instruction haven't finished charging up and so the results are garbled.



                                      Modern CPUs do very complicated things for performance reasons but this is the basic idea.



                                      Maybe that is enough to understand how the CPU moves from one thing to another thing and then moves back to the beginning. But I will go into a bit more detail.



                                      Inside the CPU are memory cells using a fixed number of transistors which can be overwritten with new values. There is also a fixed number of transistors that perform various computations, like addition, comparison, and so on. The clock opens the gate to allow data to "flow" from the memory cells, through the "compute" portion, and then the result is allowed back into the memory cells.



                                      So if your instructions are as follows:



                                      1. x = 5
                                      2. y = x + 1
                                      3. Go to step 1


                                      the processor will end up in exactly the same state when it starts each loop. (Well, in theory.)







                                      share|cite|improve this answer












                                      share|cite|improve this answer



                                      share|cite|improve this answer










                                      answered 2 days ago









                                      Artelius

                                      30112




                                      30112



























                                           

                                          draft saved


                                          draft discarded















































                                           


                                          draft saved


                                          draft discarded














                                          StackExchange.ready(
                                          function ()
                                          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f99806%2fhow-can-a-computer-run-an-infinite-loop%23new-answer', 'question_page');

                                          );

                                          Post as a guest













































































                                          Popular posts from this blog

                                          How to check contact read email or not when send email to Individual?

                                          Displaying single band from multi-band raster using QGIS

                                          How many registers does an x86_64 CPU actually have?