Consciousness qua Mortal Computation

• URL: http://arxiv.org/abs/2403.03925v1
• Date: Wed, 6 Mar 2024 18:37:06 GMT
• Title: Consciousness qua Mortal Computation
• Authors: Johannes Kleiner
• Abstract summary: We show, perhaps surprisingly, that consciousness cannot be a Turing computation. Rather, computational functionalism implies that consciousness is a novel type of computation that has recently been proposed by Geoffrey Hinton, called mortal computation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Computational functionalism posits that consciousness is a computation. Here we show, perhaps surprisingly, that it cannot be a Turing computation. Rather, computational functionalism implies that consciousness is a novel type of computation that has recently been proposed by Geoffrey Hinton, called mortal computation.

Related papers

• Representation and Interpretation in Artificial and Natural Computing [0.0]
  In the putative natural computing both processes are performed by the same agent. The mode used by digital computers is the algorithmic one. For a mode of computing to be more powerful than an algorithmic one, it ought to compute functions lacking an effective algorithm.
  arXiv  Detail & Related papers  (2025-02-14T18:57:29Z)
• Machine learning and information theory concepts towards an AI Mathematician [77.63761356203105]
  The current state-of-the-art in artificial intelligence is impressive, especially in terms of mastery of language, but not so much in terms of mathematical reasoning. This essay builds on the idea that current deep learning mostly succeeds at system 1 abilities. It takes an information-theoretical posture to ask questions about what constitutes an interesting mathematical statement.
  arXiv  Detail & Related papers  (2024-03-07T15:12:06Z)
• AI for Mathematics: A Cognitive Science Perspective [86.02346372284292]
  Mathematics is one of the most powerful conceptual systems developed and used by the human species. Rapid progress in AI, particularly propelled by advances in large language models (LLMs), has sparked renewed, widespread interest in building such systems.
  arXiv  Detail & Related papers  (2023-10-19T02:00:31Z)
• Neurocompositional computing: From the Central Paradox of Cognition to a new generation of AI systems [120.297940190903]
  Recent progress in AI has resulted from the use of limited forms of neurocompositional computing. New, deeper forms of neurocompositional computing create AI systems that are more robust, accurate, and comprehensible.
  arXiv  Detail & Related papers  (2022-05-02T18:00:10Z)
• A Theory of Consciousness from a Theoretical Computer Science Perspective: Insights from the Conscious Turing Machine [0.34265828682659694]
  We look at consciousness from the perspective of theoretical computer science (TCS) In the spirit of Alan Turing's simple yet powerful definition of a computer, the Turing Machine (TM), and perspective of computational complexity theory, we formalize a modified version of the Global Workspace Theory (GWT) of consciousness. We do this by defining the Conscious Turing Machine (CTM), also called a conscious AI, and then we define consciousness and related notions in the CTM.
  arXiv  Detail & Related papers  (2021-07-29T01:47:52Z)
• Neuromorphic Computing is Turing-Complete [0.0]
  Neuromorphic computing is a non-von Neumann computing paradigm that performs computation by emulating the human brain. Neuromorphic systems are extremely energy-efficient and known to consume thousands of times less power than CPU and GPU. We devise neuromorphic circuits for computing all the mu-recursive functions and all the mu-recursive operators.
  arXiv  Detail & Related papers  (2021-04-28T19:25:01Z)
• On quantum neural networks [91.3755431537592]
  We argue that the concept of a quantum neural network should be defined in terms of its most general function. Our reasoning is based on the use of the Feynman path integral formulation in quantum mechanics.
  arXiv  Detail & Related papers  (2021-04-12T18:30:30Z)
• Categorical computation [7.452142897055281]
  In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors between two (higher) categories.
  arXiv  Detail & Related papers  (2021-02-09T13:32:58Z)
• Inductive Biases for Deep Learning of Higher-Level Cognition [108.89281493851358]
  A fascinating hypothesis is that human and animal intelligence could be explained by a few principles. This work considers a larger list, focusing on those which concern mostly higher-level and sequential conscious processing. The objective of clarifying these particular principles is that they could potentially help us build AI systems benefiting from humans' abilities.
  arXiv  Detail & Related papers  (2020-11-30T18:29:25Z)
• Toward the quantification of cognition [0.0]
  Most human cognitive abilities, from perception to action to memory, are shared with other species. We seek to characterize those capabilities that are ubiquitously present among humans and absent from other species.
  arXiv  Detail & Related papers  (2020-08-12T21:45:29Z)
• Reservoir memory machines [79.79659145328856]
  We propose reservoir memory machines, which are able to solve some of the benchmark tests for Neural Turing Machines. Our model can also be seen as an extension of echo state networks with an external memory, enabling arbitrarily long storage without interference.
  arXiv  Detail & Related papers  (2020-02-12T01:45:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.