George Macleod Coghill
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
George Macleod Coghill has a total of 96 co-authors. Here are the top co-authors by number of shared publications:
- Wei Pang
School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, Scotland, United Kingdom
34 shared publications - John McCall
Robert Gordon University
6 shared publications Christopher Macleod
IDEAS Research Institute, Robert Gordon University, Aberdeen, Scotland
4 shared publications- David Lusseau
School of Biological Sciences University of Aberdeen Aberdeen UK
4 shared publications - Ross Donald King
University of Cambridge
4 shared publications Abubakr Awad
University of Aberdeen, Aberdeen, UK
3 shared publications
Latest Publications
- Open Access
Information, Agency, and the Trinity
Theology and science has, for traditional sciences, been a two way street. It should be no surprise then that foundational issues in semantic information theory and AI may provide insights into religious dogmas: in this case, the Christian doctrine of the Trinity. In the early days of information theory and AI, Donald M. Mackay developed two particular theories based on his research in these domains: complementarityand logical indeterminism. Each of these gives insight to the nature and behaviour of agents (artificial and natural). He also applied these theories to provide further understanding of different aspects of the Trinity. In this paper, we will see how extended and corrected versions of these can provide an understanding of why the Godhead must be multi-personal. Complementarity gives an illustrative model of the Godhead given that He is triune, whereas modal indeterminism shows why incarnation requires multi-personality (the economic Trinity). Here, we also extend the analysis to the ontological Trinity and argue that modal indeterminism also necessitates that each individual person of the Godhead cannot be absolutely omniscient (but only omniscient after their Person): only the Godhead can be absolutely omniscient. This has implications for the general relation between the persons of the Trinity, and suggests that absolute omniscience requires the unity of classical theism.
Open AccessInformation, Agency, and the Trinity
Theology and science has, for traditional sciences, been a two way street. It should be no surprise then that foundational issues in semantic information theory and AI may provide insights into religious dogmas: in this case, the Christian doctrine of the Trinity. In the early days of information theory and AI, Donald M. Mackay developed two particular theories based on his research in these domains: complementarityand logical indeterminism. Each of these gives insight to the nature and behaviour of agents (artificial and natural). He also applied these theories to provide further understanding of different aspects of the Trinity. In this paper, we will see how extended and corrected versions of these can provide an understanding of why the Godhead must be multi-personal. Complementarity gives an illustrative model of the Godhead given that He is triune, whereas modal indeterminism shows why incarnation requires multi-personality (the economic Trinity). Here, we also extend the analysis to the ontological Trinity and argue that modal indeterminism also necessitates that each individual person of the Godhead cannot be absolutely omniscient (but only omniscient after their Person): only the Godhead can be absolutely omniscient. This has implications for the general relation between the persons of the Trinity, and suggests that absolute omniscience requires the unity of classical theism.
- Open Access
Towards a Measure Theory of Semantic Information
A classic account of the quantification of semantic information is that of Bar-Hiller and Carnap. Their account proposes an inverse relation between the informativeness of a statement and its probability. However, their approach assigns the maximum informativeness to a contradiction: which Floridi refers to as the Bar-Hillel-Carnap paradox. He developed a novel theory founded on a distance metric and parabolic relation, designed to remove this paradox. Unfortunately is approach does not succeed in that aim. In this paper I critique Floridi's theory of strongly semantic information on its own terms and show where it succeeds and fails. I then present a new approach based on the unit circle (a relation that has been the basis of theories from basic trigonometry to quantum theory). This is used, by analogy with von Neumann's quantum probability to construct a measure space for informativeness that meets all the requirements stipulated by Floridi and removes the paradox. In addition, while contradictions and tautologies have zero informativeness, it is found that messages which are contradictory to each other are equally informative. The utility of this is explained by means of an example.
Open AccessTowards a Measure Theory of Semantic Information
A classic account of the quantification of semantic information is that of Bar-Hiller and Carnap. Their account proposes an inverse relation between the informativeness of a statement and its probability. However, their approach assigns the maximum informativeness to a contradiction: which Floridi refers to as the Bar-Hillel-Carnap paradox. He developed a novel theory founded on a distance metric and parabolic relation, designed to remove this paradox. Unfortunately is approach does not succeed in that aim. In this paper I critique Floridi's theory of strongly semantic information on its own terms and show where it succeeds and fails. I then present a new approach based on the unit circle (a relation that has been the basis of theories from basic trigonometry to quantum theory). This is used, by analogy with von Neumann's quantum probability to construct a measure space for informativeness that meets all the requirements stipulated by Floridi and removes the paradox. In addition, while contradictions and tautologies have zero informativeness, it is found that messages which are contradictory to each other are equally informative. The utility of this is explained by means of an example.
- Open Access
- 24 March 2025
- Published by MDPI AG in Preprints.org
Towards a Measure Theory of Semantic Information
The classic account of the quantification of semantic information is that of Bar Hillel and Carnap. However, their approach assigns the maximum informativeness to a contradiction. This situation is what Floridi refers to as the Bar Hillel-Carnap paradox, and he developed a novel theory designed to remove this paradox. Unfortunately his approach does not succeed in that aim. In this paper I critique Floridi’s theory of strongly semantic information on its own terms and show where it succeeds and fails. I then present a novel approach based on methods from communication theory and quantum probability that meets all the requirements stipulated by Floridi and removes the paradox.
- 24 March 2025
- Published by MDPI AG in Preprints.org
Open AccessTowards a Measure Theory of Semantic Information
The classic account of the quantification of semantic information is that of Bar Hillel and Carnap. However, their approach assigns the maximum informativeness to a contradiction. This situation is what Floridi refers to as the Bar Hillel-Carnap paradox, and he developed a novel theory designed to remove this paradox. Unfortunately his approach does not succeed in that aim. In this paper I critique Floridi’s theory of strongly semantic information on its own terms and show where it succeeds and fails. I then present a novel approach based on methods from communication theory and quantum probability that meets all the requirements stipulated by Floridi and removes the paradox.
- Open Access
- 11 November 2023
- Published by University of St. Andrews Library in Theology in Scotland
- Vol. 30 (2) , 66-74
Behind the eye: Donald M. MacKay and the 1986 Glasgow Gifford Lectures
The 1986 Gifford Lectures were delivered by Donald M. MacKay, Emeritus Professor of Communication and Neuroscience at Keele University. The ten lectures were later turned into a book titled Behind the Eye. This paper, in our series on notable Gifford Lectures, provides a summary of MacKay's arguments as they relate to natural theology, along with some critical comments.
- 11 November 2023
- Published by University of St. Andrews Library in Theology in Scotland
- Vol. 30 (2) , 66-74
Open AccessBehind the eye: Donald M. MacKay and the 1986 Glasgow Gifford Lectures
The 1986 Gifford Lectures were delivered by Donald M. MacKay, Emeritus Professor of Communication and Neuroscience at Keele University. The ten lectures were later turned into a book titled Behind the Eye. This paper, in our series on notable Gifford Lectures, provides a summary of MacKay's arguments as they relate to natural theology, along with some critical comments.
- Open Access
- 26 June 2023
- Published by Springer Nature in Soft Computing
- Vol. 27 (20) , 14699-14719
A novel Physarum-inspired competition algorithm for discrete multi-objective optimisation problems
Many real-world problems can be naturally formulated as discrete multi-objective optimisation (DMOO) problems. We have proposed a novel Physarum-inspired competition algorithm (PCA) to tackle these DMOO problems. Our algorithm is based on hexagonal cellular automata (CA) as a representation of problem search space and reaction–diffusion systems that control the Physarum motility. Physarum’s decision-making power and the discrete properties of CA have made our algorithm a perfectly suitable approach to solve DMOO problems. Each cell in the CA grid will be decoded as a solution (objective function) and will be regarded as a food resource to attract Physarum. The n-dimensional generalisation of the hexagonal CA grid has allowed us to extend the solving capabilities of our PCA from only 2-D to n-D optimisation problems. We have implemented a novel restart procedure to select the global Pareto frontier based on both personal experience and shared information. Extensive experimental and statistical analyses were conducted on several benchmark functions to assess the performance of our PCA against other evolutionary algorithms. As far as we know, this study is the first attempt to assess algorithms that solve DMOO problems, with a large number of benchmark functions and performance indicators. Our PCA has confirmed our assumption that individual skills of competing Physarum are more efficient in exploration and increase the diversity of the solutions. It has achieved the best performance for the Spread indicator (diversity), similar performance results compared to the strength Pareto evolutionary algorithm (SPEA2) and even outperformed other well-established genetic algorithms.
- 26 June 2023
- Published by Springer Nature in Soft Computing
- Vol. 27 (20) , 14699-14719
Open AccessA novel Physarum-inspired competition algorithm for discrete multi-objective optimisation problems
Many real-world problems can be naturally formulated as discrete multi-objective optimisation (DMOO) problems. We have proposed a novel Physarum-inspired competition algorithm (PCA) to tackle these DMOO problems. Our algorithm is based on hexagonal cellular automata (CA) as a representation of problem search space and reaction–diffusion systems that control the Physarum motility. Physarum’s decision-making power and the discrete properties of CA have made our algorithm a perfectly suitable approach to solve DMOO problems. Each cell in the CA grid will be decoded as a solution (objective function) and will be regarded as a food resource to attract Physarum. The n-dimensional generalisation of the hexagonal CA grid has allowed us to extend the solving capabilities of our PCA from only 2-D to n-D optimisation problems. We have implemented a novel restart procedure to select the global Pareto frontier based on both personal experience and shared information. Extensive experimental and statistical analyses were conducted on several benchmark functions to assess the performance of our PCA against other evolutionary algorithms. As far as we know, this study is the first attempt to assess algorithms that solve DMOO problems, with a large number of benchmark functions and performance indicators. Our PCA has confirmed our assumption that individual skills of competing Physarum are more efficient in exploration and increase the diversity of the solutions. It has achieved the best performance for the Spread indicator (diversity), similar performance results compared to the strength Pareto evolutionary algorithm (SPEA2) and even outperformed other well-established genetic algorithms.
- Open Access
- 4 May 2023
- Published by SAGE Publications in Studies in Christian Ethics
- Vol. 36 (3) , 604-619
Artificial Intelligence (and Christianity): Who? What? Where? When? Why? and How?
Artificial Intelligence (AI) is a high-profile subject these days. In its brief history it has undergone several highs and lows and suffered from significant degrees of hype as well as antagonism and fear. One thing is clear: we are no closer to the goal of producing a truly sentient being than when it started. Nonetheless, the tools developed by AI researchers are here to stay and as with all technological advances it has its good and bad aspects. In this article I will present a brief overview of the field of AI looking at what it is, how it developed, what are its specialism as well as some of its well-publicised successes, and failures, as well as pointing out some key Christian participants in the story.
- 4 May 2023
- Published by SAGE Publications in Studies in Christian Ethics
- Vol. 36 (3) , 604-619
Open AccessArtificial Intelligence (and Christianity): Who? What? Where? When? Why? and How?
Artificial Intelligence (AI) is a high-profile subject these days. In its brief history it has undergone several highs and lows and suffered from significant degrees of hype as well as antagonism and fear. One thing is clear: we are no closer to the goal of producing a truly sentient being than when it started. Nonetheless, the tools developed by AI researchers are here to stay and as with all technological advances it has its good and bad aspects. In this article I will present a brief overview of the field of AI looking at what it is, how it developed, what are its specialism as well as some of its well-publicised successes, and failures, as well as pointing out some key Christian participants in the story.
- Open Access
- 16 November 2022
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 56 (1) , 1-26
A survey on physarum polycephalum intelligent foraging behaviour and bio-inspired applications
In recent years, research on Physarum polycephalum has become more popular after Nakagaki (AIR 407: 6803-470, 2000) performed their famous experiment showing that Physarum was able to find the shortest route through a maze. Subsequent researches have confirmed the ability of Physarum-inspired algorithms to solve a wide range of real-world applications. In contrast to previous reviews that either focus on biological aspects or bio-inspired applications, here we present a comprehensive review that highlights recent Physarum polycephalum biological aspects, mathematical models, and Physarum bio-inspired algorithms and their applications. The novelty of this review stems from our exploration of Physarum intelligent behaviour in competition settings. Further, we have presented our new model to simulate Physarum in competition, where multiple Physarum interact with each other and with their environments. The bio-inspired Physarum in competition algorithms proved to have great potentials for future research.
- 16 November 2022
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 56 (1) , 1-26
Open AccessA survey on physarum polycephalum intelligent foraging behaviour and bio-inspired applications
In recent years, research on Physarum polycephalum has become more popular after Nakagaki (AIR 407: 6803-470, 2000) performed their famous experiment showing that Physarum was able to find the shortest route through a maze. Subsequent researches have confirmed the ability of Physarum-inspired algorithms to solve a wide range of real-world applications. In contrast to previous reviews that either focus on biological aspects or bio-inspired applications, here we present a comprehensive review that highlights recent Physarum polycephalum biological aspects, mathematical models, and Physarum bio-inspired algorithms and their applications. The novelty of this review stems from our exploration of Physarum intelligent behaviour in competition settings. Further, we have presented our new model to simulate Physarum in competition, where multiple Physarum interact with each other and with their environments. The bio-inspired Physarum in competition algorithms proved to have great potentials for future research.
- Open Access
A Survey on Physarum Polycephalum Intelligent Foraging Behaviour and Bio-Inspired Applications
In recent years, research on Physarum polycephalum has become more popular after Nakagaki et al. (2000) performed their famous experiment showing that Physarum was able to find the shortest route through a maze. Subsequent researches have confirmed the ability of Physarum-inspired algorithms to solve a wide range of NP-hard problems. In contrast to previous reviews that either focus on biological aspects or bio-inspired applications, here we present a comprehensive review that highlights recent Physarum polycephalum biological aspects, mathematical models, and Physarum bio-inspired algorithms and their applications. The novelty of this review stems from our exploration of Physarum intelligent behaviour in competition settings. Further, we have presented our new model to simulate Physarum in competition, where multiple Physarum interact with each other and with their environments. The bio-inspired Physarum in competition algorithms proved to have great potentials for future research.
Open AccessA Survey on Physarum Polycephalum Intelligent Foraging Behaviour and Bio-Inspired Applications
In recent years, research on Physarum polycephalum has become more popular after Nakagaki et al. (2000) performed their famous experiment showing that Physarum was able to find the shortest route through a maze. Subsequent researches have confirmed the ability of Physarum-inspired algorithms to solve a wide range of NP-hard problems. In contrast to previous reviews that either focus on biological aspects or bio-inspired applications, here we present a comprehensive review that highlights recent Physarum polycephalum biological aspects, mathematical models, and Physarum bio-inspired algorithms and their applications. The novelty of this review stems from our exploration of Physarum intelligent behaviour in competition settings. Further, we have presented our new model to simulate Physarum in competition, where multiple Physarum interact with each other and with their environments. The bio-inspired Physarum in competition algorithms proved to have great potentials for future research.
- Open Access
ImmuNeCS: Neural Committee Search by an Artificial Immune System
Current Neural Architecture Search techniques can suffer from a few shortcomings, including high computational cost, excessive bias from the search space, conceptual complexity or uncertain empirical benefits over random search. In this paper, we present ImmuNeCS, an attempt at addressing these issues with a method that offers a simple, flexible, and efficient way of building deep learning models automatically, and we demonstrate its effectiveness in the context of convolutional neural networks. Instead of searching for the 1-best architecture for a given task, we focus on building a population of neural networks that are then ensembled into a neural network committee, an approach we dub 'Neural Committee Search'. To ensure sufficient performance from the committee, our search algorithm is based on an artificial immune system that balances individual performance with population diversity. This allows us to stop the search when accuracy starts to plateau, and to bridge the performance gap through ensembling. In order to justify our method, we first verify that the chosen search space exhibits the locality property. To further improve efficiency, we also combine partial evaluation, weight inheritance, and progressive search. First, experiments are run to verify the validity of these techniques. Then, preliminary experimental results on two popular computer vision benchmarks show that our method consistently outperforms random search and yields promising results within reasonable GPU budgets. An additional experiment also shows that ImmuNeCS's solutions transfer effectively to a more difficult task, where they achieve results comparable to a direct search on the new task. We believe these findings can open the way for new, accessible alternatives to traditional NAS.
Open AccessImmuNeCS: Neural Committee Search by an Artificial Immune System
Current Neural Architecture Search techniques can suffer from a few shortcomings, including high computational cost, excessive bias from the search space, conceptual complexity or uncertain empirical benefits over random search. In this paper, we present ImmuNeCS, an attempt at addressing these issues with a method that offers a simple, flexible, and efficient way of building deep learning models automatically, and we demonstrate its effectiveness in the context of convolutional neural networks. Instead of searching for the 1-best architecture for a given task, we focus on building a population of neural networks that are then ensembled into a neural network committee, an approach we dub 'Neural Committee Search'. To ensure sufficient performance from the committee, our search algorithm is based on an artificial immune system that balances individual performance with population diversity. This allows us to stop the search when accuracy starts to plateau, and to bridge the performance gap through ensembling. In order to justify our method, we first verify that the chosen search space exhibits the locality property. To further improve efficiency, we also combine partial evaluation, weight inheritance, and progressive search. First, experiments are run to verify the validity of these techniques. Then, preliminary experimental results on two popular computer vision benchmarks show that our method consistently outperforms random search and yields promising results within reasonable GPU budgets. An additional experiment also shows that ImmuNeCS's solutions transfer effectively to a more difficult task, where they achieve results comparable to a direct search on the new task. We believe these findings can open the way for new, accessible alternatives to traditional NAS.
- Open Access
- 29 July 2020
- Published by Springer Nature in Memetic Computing
- Vol. 12 (3) , 267-282
Inferring structure and parameters of dynamic system models simultaneously using swarm intelligence approaches
Inferring dynamic system models from observed time course data is very challenging compared to static system identification tasks. Dynamic system models are complicated to infer due to the underlying large search space and high computational cost for simulation and verification. In this research we aim to infer both the structure and parameters of a dynamic system simultaneously by particle swarm optimization (PSO) improved by efficient stratified sampling approaches. More specifically, we enhance PSO with two modern stratified sampling techniques, i.e., Latin hyper cube sampling (LHS) and Latin hyper cube multi dimensional uniformity (LHSMDU). We propose and evaluate two novel swarm-inspired algorithms, LHS-PSO and LHSMDU-PSO, which can be used particularly to learn the model structure and parameters of complex dynamic systems efficiently. The performance of LHS-PSO and LHSMDU-PSO is further compared with the original PSO and genetic algorithm (GA). We chose real-world cancer biological model called Kinetochores to asses the learning performance of LHSMDU-PSO and LHS-PSO in comparison with GA and the original PSO. The experimental results show that LHSMDU-PSO can find promising models with reasonable parameters and structure, and it outperforms LHS-PSO, PSO, and GA in our experiments.
- 29 July 2020
- Published by Springer Nature in Memetic Computing
- Vol. 12 (3) , 267-282
Open AccessInferring structure and parameters of dynamic system models simultaneously using swarm intelligence approaches
Inferring dynamic system models from observed time course data is very challenging compared to static system identification tasks. Dynamic system models are complicated to infer due to the underlying large search space and high computational cost for simulation and verification. In this research we aim to infer both the structure and parameters of a dynamic system simultaneously by particle swarm optimization (PSO) improved by efficient stratified sampling approaches. More specifically, we enhance PSO with two modern stratified sampling techniques, i.e., Latin hyper cube sampling (LHS) and Latin hyper cube multi dimensional uniformity (LHSMDU). We propose and evaluate two novel swarm-inspired algorithms, LHS-PSO and LHSMDU-PSO, which can be used particularly to learn the model structure and parameters of complex dynamic systems efficiently. The performance of LHS-PSO and LHSMDU-PSO is further compared with the original PSO and genetic algorithm (GA). We chose real-world cancer biological model called Kinetochores to asses the learning performance of LHSMDU-PSO and LHS-PSO in comparison with GA and the original PSO. The experimental results show that LHSMDU-PSO can find promising models with reasonable parameters and structure, and it outperforms LHS-PSO, PSO, and GA in our experiments.