Seems like Backus likes postfix syntax. Same goes with BNF which reserves cardinality at the end. Does anyone consider the first example easier to read? As a mere Human, I find the syntax hard to follow. 1978 was the era when AI provers were solving theorems in hundreds of steps, which was impossible for a Human to follow.
So, what are the non-von architectures to play with? GPUs? FPGAs? For GPUs, Cellular Automata is a lot of fun. For FPGAs, perhaps Petri Nets. A classic connectionist book is the Minds of Robots, by Culbertson.
What next? Light prisms? How the hell would you program one of those? Or perhaps the problem becomes how to create highly distributed pipelines?
So, what are the non-von architectures to play with? GPUs? FPGAs? For GPUs, Cellular Automata is a lot of fun. For FPGAs, perhaps Petri Nets. A classic connectionist book is the Minds of Robots, by Culbertson.
What next? Light prisms? How the hell would you program one of those? Or perhaps the problem becomes how to create highly distributed pipelines?