Sam_Hayzen
Sam_Hayzen
94 / 9
14th Jan 2019
11th Sep 2019
This computer is free to use, with or without credit. User manual: https://powdertoy.co.uk/Discussions/Thread/View.html?Thread=23160
fibonacci computer record electronic turing processor

Comments

  • Sam_Hayzen
    Sam_Hayzen
    17th Jan 2019
    Also, @allenxch, I replied to your message.
  • Sam_Hayzen
    Sam_Hayzen
    17th Jan 2019
    @R33sesK1ng Yeah, probably. On the -D28s, I opted to remove the Adder and Program Counter and replaced them with simpler logic systems that are more compact if made with FILT instead of analog. You wanna see?
  • Sam_Hayzen
    Sam_Hayzen
    17th Jan 2019
    @unnick In order for something to be truly Turing-Complete, it must be able to compute any computable sequence. But, in order to compute -any- computable sequence, a machine must have unlimited memory. It's kind'a a thing to ignore the limitations of finite memory when classifying a machine as Turing-complete or not.
  • Sam_Hayzen
    Sam_Hayzen
    17th Jan 2019
    @Bejjamin_C_2007 Yeah, NoVIcE is right.
  • R33sesK1ng
    R33sesK1ng
    17th Jan 2019
    @poodiepie, I would imagine these are very simple because of tbe amount of FILT logic in use...
  • NoVIcE
    NoVIcE
    17th Jan 2019
    @benj...07 surface area would be more correct
  • unnick
    unnick
    17th Jan 2019
    how can it be turing-complete when it only has read only memory and a few registers?
  • expunged
    expunged
    17th Jan 2019
    There is no such thing as volume in tpt
  • allenxch
    allenxch
    17th Jan 2019
    wow,how long does it take to make one of those? i just cant believe u finished another one in just three days!
  • Sam_Hayzen
    Sam_Hayzen
    17th Jan 2019
    >Just completed a smaller one; the A7/28D28. Testing it rn; needs an example program.