Some considerations on universality

zbMATH Open1455.68055arXiv0906.3199MaRDI QIDQ5145154FDOQ5145154

Authors: Manfred Kudlek 

Publication date: 20 January 2021

Full work available at URL: https://arxiv.org/abs/0906.3199

Recommendations

• scientific article; zbMATH DE number 2150282
• Universal Turing machines with complexity constraint
• Logical Approaches to Computational Barriers
• On machines, universal by extensions
• Honest universality

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Cited In (11)

• Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
• On computable numbers, nonuniversality, and the genuine power of parallelism
• Is universal computation a myth?
• Title not available (Why is that?)
• Honest universality
• The difference between optimality and universality
• A framework for universality in physics, computer science, and beyond
• Universality in two dimensions
• What is a universal computing machine?
• Title not available (Why is that?)
• Universality, Reducibility, and Completeness

This page was built for publication: Some considerations on universality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145154)