I made a computer again. It can do a lot of stuff the previous one couldn't and can do most stuff that I'd ever wanted a TPT computer to do. It definitely can churn out Fibonacci numbers and primes. Check the relevant forum thread too.
subframe
processor
technology
mandelbrot
dayofweek
fibonacci
prime
r316
computer
magic
Comments
-
@LBPHacker I could use a config file or a command propmpt for the C compiler to choose what machine to compile the code for like what you can do in cc65 and as I said before, ill probably use a modified C compiler for 65x because I think I know too much about 65x and 65x compilers...
-
Maybe lol, depends on how much free time I can allocate to this. I've had a C compiler for my previous computer in my TODOs for a while too. Anyway, don't bother targeting tptasm, the instruction syntax is different for every backend (target architecture), it's only the macro/pragma syntax that's shared. You're better off emitting machine code directly.
-
@LBPHacker Are there any plans to create a high level language compiler such as C for TPTASM? If there arent any, thats fine because I can just make a modified Z80 or 65x compiler myself because their syntax are similar to TPASM.
-
This is off FP now, nice run, thank you all.
-
The one exception is fetching an instruction freshly written by the previous instruction, which the manual documents as yielding the value before the write. This is not due to the nature of subframe or multi-instruction-per-frame computing in TPT, this is just because this specific computer was easier to build that way.
-
This is not in fact in the manual because it's not a problem in general. Subframe enforces a total order on the update code of all particles, and you can (and this computer does) transmute that into total order on memory accesses.
-
Sorry if this question could be answered by rtfm-ing, but I'm curious how data hazzards are handled in comparison to a "real" architecture. I'd have to imagine writing to and reading from one address on the same frame is difficult.
-
@LBPHacker will there ever be audio added to this game?
-
The ALU is 16b but I rolled my own bignum primitive for fibonacci. It uses base 10000 digits to make printing easier. Fibonacci happens to be one of the demos that I've already documented, see https://github.com/LBPHacker/R316/blob/v2/examples/demo.asm
-
What's the integer limit on this computer? Seems like fibonacci can run indefinitely with sufficient ram?