What can we learn from universal Turing machines?

• URL: http://arxiv.org/abs/2110.08511v1
• Date: Sat, 16 Oct 2021 08:43:29 GMT
• Title: What can we learn from universal Turing machines?
• Authors: Maurice Margenstern
• Abstract summary: We construct what we call a pedagogical universal Turing machine. We try to understand which comparisons with biological phenomena can be deduced from its encoding and from its working.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the present paper, we construct what we call a pedagogical universal Turing machine. We try to understand which comparisons with biological phenomena can be deduced from its encoding and from its working.

Related papers

• Passed the Turing Test: Living in Turing Futures [0.0]
  We are now living in one of many possible Turing futures where machines can pass for what they are not. However, the learning machines that Turing imagined would pass his imitation tests were machines inspired by the natural development of the low-energy human cortex.
  arXiv  Detail & Related papers  (2024-09-11T22:56:30Z)
• On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning [87.73401758641089]
  Chain-of-thought (CoT) reasoning has improved the performance of modern language models (LMs) We show that LMs can represent the same family of distributions over strings as probabilistic Turing machines.
  arXiv  Detail & Related papers  (2024-06-20T10:59:02Z)
• Can I say, now machines can think? [0.0]
  We analyzed and explored the capabilities of artificial intelligence-enabled machines. Turing Test is a critical aspect of evaluating machines' ability. There are other aspects of intelligence too, and AI machines exhibit most of these aspects.
  arXiv  Detail & Related papers  (2023-07-11T11:44:09Z)
• Towards a Self-Replicating Turing Machine [0.0]
  We provide partial implementations of von Neumann's universal constructor and universal copier. Using the same principles, we also construct Turing machines. Our construction allows for mutations if desired, and we give a simple description language.
  arXiv  Detail & Related papers  (2023-06-29T11:50:58Z)
• From Word Models to World Models: Translating from Natural Language to the Probabilistic Language of Thought [124.40905824051079]
  We propose rational meaning construction, a computational framework for language-informed thinking. We frame linguistic meaning as a context-sensitive mapping from natural language into a probabilistic language of thought. We show that LLMs can generate context-sensitive translations that capture pragmatically-appropriate linguistic meanings. We extend our framework to integrate cognitively-motivated symbolic modules.
  arXiv  Detail & Related papers  (2023-06-22T05:14:00Z)
• The Human-or-Machine Matter: Turing-Inspired Reflections on an Everyday Issue [4.309879785418976]
  We sidestep the question of whether a machine can be labeled intelligent, or can be said to match human capabilities in a given context. We first draw attention to the seemingly simpler question a person may ask themselves in an everyday interaction: Am I interacting with a human or with a machine?''
  arXiv  Detail & Related papers  (2023-05-07T15:41:11Z)
• Token Turing Machines [53.22971546637947]
  Token Turing Machines (TTM) is a sequential, autoregressive Transformer model with memory for real-world sequential visual understanding. Our model is inspired by the seminal Neural Turing Machine, and has an external memory consisting of a set of tokens which summarise the previous history.
  arXiv  Detail & Related papers  (2022-11-16T18:59:18Z)
• A Relative Church-Turing-Deutsch Thesis from Special Relativity and Undecidability [0.0]
  We show that computing the time, space, or error accumulated by the global simulator are simulation properties and therefore are undecidable. These simulation properties give rise to special relativistic effects in the relative model which we use to construct a Church-Turing-Deutsch thesis.
  arXiv  Detail & Related papers  (2022-06-13T18:58:41Z)
• The Logic of Quantum Programs [77.34726150561087]
  We present a logical calculus for reasoning about information flow in quantum programs. In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems.
  arXiv  Detail & Related papers  (2021-09-14T16:08:37Z)
• 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)
• Machine learning transfer efficiencies for noisy quantum walks [62.997667081978825]
  We show that the process of finding requirements on both a graph type and a quantum system coherence can be automated. The automation is done by using a convolutional neural network of a particular type that learns to understand with which network and under which coherence requirements quantum advantage is possible. Our results are of importance for demonstration of advantage in quantum experiments and pave the way towards automating scientific research and discoveries.
  arXiv  Detail & Related papers  (2020-01-15T18:36:53Z)

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.