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 insane

Comments

  • Sam_Hayzen
    Sam_Hayzen
    18th Jan 2019
    Hmm, I'm thinking just maybe formally defining "computer" on TPT. But, that might cause some other problems of its own.
  • nukers473
    nukers473
    18th Jan 2019
    Perhaps, 'computational device' can be used.
  • Sam_Hayzen
    Sam_Hayzen
    18th Jan 2019
    Though the 'processor' itself is still computationally universal. I think a new term would be better.
  • allenxch
    allenxch
    18th Jan 2019
    im not sure if tpt can provide enough space for enough memory for a wwld rule110 "computer" to run the fibonacci sequence
  • Sam_Hayzen
    Sam_Hayzen
    18th Jan 2019
    Well, I don't think we should redefine Turing Complete; it's a real, established term. Perhaps we should make a new term?
  • allenxch
    allenxch
    18th Jan 2019
    for example of course the classic fibonacci sequence
  • allenxch
    allenxch
    18th Jan 2019
    maybe we can come up with a set of programs and machines that can run these programs are turing complete
  • allenxch
    allenxch
    18th Jan 2019
    poodiepie: yeah exactly, so that's why we need to redefine turing complete in tpt
  • Sam_Hayzen
    Sam_Hayzen
    18th Jan 2019
    Well heck. What's the point of any of these complex processors when you can just make a 110 thing out of some WWLD?
  • allenxch
    allenxch
    18th Jan 2019
    well,any machine that can simulate rule 110 is turing complete for sure,though with finite memory.