35 citations · 153 across the 34 of their papers we have counts for
36 papers
Fragmentation is a diversity ratchet
Russell K. Standish
A fragmented landscape reduces the impact of interspecies connectivity, leading to higher diversity levels than otherwise possible in a connected landscape. Reconnecting a previous…
An improved upper bound measure of star complexity of graphs
Russell K. Standish
In \cite{Standish25c}, I explored the connection between star complexity and information based complexity. Because of the numerical difficulty in computing star complexity, I intro…
The Movie Graph Argument Revisited
Russell K. Standish
In this paper, we reexamine the Movie Graph Argument, which demonstrates a basic incompatibility between computationalism and materialism. We discover that the incompatibility is o…
Mechanical generation of networks with surplus complexity
Russell Standish
In previous work I examined an information based complexity measure of networks with weighted links. The measure was compared with that obtained from by randomly shuffling the orig…
Information Based Complexity of Networks
Russell K. Standish
Review article of various complexity measures of networks
Comment on "On the proper behavior of atoms" by Paul Anglin
Russell K. Standish, Stephen L. Keen
Paul Anglin criticised our analysis of the neoclassical theory of the firm, but makes a number of incorrect assertions about our assumptions. We correct these misunderstandings, bu…