Other CA Work
- Capacity
- Richard Bowles completed his PhD in June on the Capacity of CA
networks.
- It turns out that you can store as many bits as you have of
memory.
- Conseqeuently if you have N neurons with K synapses with S bits each,
you can store at most NKS bits of information.
- Richard had a system that had O(NKS) bits of information.
- Categorisation
- Chamila Fernando on Categorisation
- We got a Nuffield grant to support Chamila for a few weeks
this summer.
- He's made good progress on some standard natural kind tasks
- He's also made some progress on the linearly inseperable monks task.
- I also have some other thesis students who are working on
categorisation tasks.
- Stroop task
- with Ray Adams and Serengul Smith
- If you present the word red in blue ink it's slower to ignite.
- This should be readily implementable in CAs.
- Have an input that activates the word the colour.
- The colour is linked to the word so it inhibits it or excites
it when appropriate.
- There will probably be a lot of tuning to get it to duplicate
the data.
