The Powder Toy

Tesla-A10D28 by Sam_Hayzen

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

  • NoVIcE
    NoVIcE     17th Jan 2019
    BTW, [challenge accepted]. Will begin soon, probably not though, sometime. I consider to make the "smallest computer ever save" a list of smallest computers, because it is representing what it means (or just to finally be able to rename saves, tpt pls fix)
  • Sam_Hayzen
    Sam_Hayzen     17th Jan 2019
    Only time will tell, I suppose. The A7/28D28 is able to use Bus as a 28-bit index register. So, only those with crazy-high standards for memory spaces will call them non-complete, kek.
  • unnick
    unnick     17th Jan 2019
    maybe, but im not entirely convinced. its still a cool computer though.
  • Sam_Hayzen
    Sam_Hayzen     17th Jan 2019
    Oof, this whole time it was saying "605 Malformed response." Oi vey...
  • Sam_Hayzen
    Sam_Hayzen     17th Jan 2019
    https://en.m.wikipedia.org/wiki/Turing_completeness
  • Sam_Hayzen
    Sam_Hayzen     17th Jan 2019
    https://en.m.wikipedia.org/wiki/Turing_completeness
  • Sam_Hayzen
    Sam_Hayzen     17th Jan 2019
    en.m.wikipedia.org/wiki/Turing_completeness
  • Sam_Hayzen
    Sam_Hayzen     17th Jan 2019
    It is. A machine with 200 bits of memory is no closer to infinite memory than a machine with 4GiB of memory; as no real number can approach infinity. There's not really a defined place where we could "draw a line." Turing-completeness is defined by the nature of a language/instruction set, not by the actual amount of memory in a machine.
  • unnick
    unnick     17th Jan 2019
    for example, if you tried to implement the sieve of eratosthenes to compute prime numbers, you could only compute primes less than 200! and thats ignoring the fact that some of the registers arent general purpose registers.
  • unnick
    unnick     17th Jan 2019
    @poodiepie i know that you need unlimited memory to make a computer turing-complete but i dont think only ~200 bits of memory in registers is enough memory to be practically turing-complete