QL Hacker’s Journal 4

Date: July 1991
Issue: 4
See all issues of QL Hacker's Journal

Articles

Title Description Computers
Cellular Automata Back in college, I was short 1/2 a unit from graduating. To make up the unit, I enrolled in a 1 unit Independent Study course. With hours left before the enrollment deadline, I picked what I thought was a weak but interesting subject, Cellular Automata (CA). Well, the more I researched the topic, the more Sinclair QL
Editor's Forum This issue is another one that took some time to come together. I have spent part of the last two months beating my head against a single program. I have been working on a C version of my Cellular Automata program. After I finally found a decent random number generator, I made some changes to Sinclair QL
Iterated Function Systems IFS is what Michael Barnsley calls his Iterated Function Systems, and IFS is another part of fractals (remember those Mandelbrot all-nighters ?). Barnsley did IFS a few years ago and has gone on to bigger and better stuff now. He explains how IFS can be done by anyone with a personal computer using a “collage” Sinclair QL
Rand_c In translating one of my pet programs from SuperBasic (first it started in Pascal), I needed a number of random numbers. Not finding a random number generator in Small-C, I decided to write the program in Lattice C. But, Lattice C does not really have any QL graphic functions. So back I go to Small-C Sinclair QL
Scroll to Top