20世紀の名著名論：A.M.Turing: On Computable Numbers with an Application to the Entscheidungsproblem

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Unknown venue

• Publication date

  2002-04-15

• Fields of study

  Mathematics, Philosophy

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• AI, Education, and Academic Publishing in between Knowledge Capitalism and Socialism

  2025cites this paper
• Landauer principle and thermodynamics of computation

  2025cites this paper
• The Need for a Big World Simulator: A Scientific Challenge for Continual Learning

  2024cites this paper
• Reliable AI: Does the Next Generation Require Quantum Computing?

  2023cites this paper
• On the complexity of algebraic numbers, and the bit-complexity of straight-line programs

  2023cites this paper
• The Internal Logic and Finite Colimits

  2023cites this paper
• Gödel's Theorem Without Tears - Essential Incompleteness in Synthetic Computability

  2023cites this paper
• Epi-constructivism: Decidable sets of computable numbers as foundational objects for mathematics

  2022cites this paper
• Cognitive Mimetics - SMT Model

  2022cites this paper
• Digital Ark of Knowledge

  2022cites this paper
• Lecture Notes on Axiomatic Semantics

  2022cites this paper
• Cybernétique, interactivité et conversation : retour sur les effets des expériences de Gordon S. Pask en architecture

  2022cites this paper
• Turing Machines cannot simulate the human mind

  2022cites this paper
• Evolution of the Concept of Self-Organization by the Founding Fathers of A.I.

  2022cites this paper
• Undecidability of Dyadic First-Order Logic in Coq

  2022cites this paper
• Computation as uncertainty reduction: a simplified order-theoretic framework

  2022cites this paper
• Computing Real Numbers with Large-Population Protocols Having a Continuum of Equilibria

  2022cites this paper
• A Reputation-Based Mechanism for Transaction Processing in Blockchain Systems

  2022cites this paper
• Online, computable and punctual structure theory

  2022cites this paper
• “From So Simple a Beginning”: Species of Artificial Intelligence

  2022cites this paper
• Transforming Low-Level Variants of Greatest Common Divisor Algorithm: A Case Study

  2022cites this paper
• Enjeux de la modélisation formelle en sémiotique computationnelle

  2022cites this paper
• Communication and information complexity

  2022cites this paper
• An Overview of Information-Theoretic Security and Privacy: Metrics, Limits and Applications

  2021cites this paper
• The Psychology of Thinking in Creating AI

  2021influential citation
• Development of an unfolding model of procedures for programming learning of novice programmers

  2021cites this paper
• Addressing Machines as models of lambda-calculus

  2021cites this paper
• Real Number Signal Processing can Detect Denial-of-Service Attacks

  2021cites this paper
• Artificial life: sustainable self-replicating systems

  2021cites this paper
• Theoretical Computer Science in Italy: The Early Years

  2021cites this paper
• The Undecidability of Network Coding with some Fixed-Size Messages and Edges

  2021cites this paper
• Some Quantum Mechanical Properties of the Wolfram Model

  2020cites this paper
• On Partial Differential Encodings, with Application to Boolean Circuits

  2020cites this paper
• Computability of the Peak Value of Bandlimited Signals

  2020cites this paper
• T he L ogic in C omputer S cience C olumn

  2020cites this paper
• Epimenides, Gödel, Turing: An Eternal Gölden Twist

  2020cites this paper
• An Ansatz for undecidable computation in RNA-world automata

  2020cites this paper
• Computability of the Zero-Error Capacity with Kolmogorov Oracle

  2020cites this paper
• Means-fit effectivity

  2020cites this paper
• A scalable photonic computer solving the subset sum problem

  2020cites this paper
• Combining Determinism and Non-Determinism

  2020cites this paper
• Turing Computability of Fourier Transforms of Bandlimited and Discrete Signals

  2020influential citation
• What is a complex system?

  2020cites this paper
• Computability up to homeomorphism

  2020cites this paper
• On Partial Differential Encodings of Boolean Functions

  2020cites this paper
• Secure Communication and Identification Systems — Effective Performance Evaluation on Turing Machines

  2020cites this paper
• Effective Approximation of Bandlimited Signals and Their Samples

  2020cites this paper
• The P versus NP Solution

  2020cites this paper
• FOUNDATIONS OF ONLINE STRUCTURE THEORY

  2019cites this paper
• Offline Handwritten Text Recognition using Convolutional Recurrent Neural Network

  2019cites this paper
• On the Computability of the Secret Key Capacity under Rate Constraints

  2019cites this paper
• Detectability of Denial-of-service Attacks on Communication Systems

  2019cites this paper
• Unconstrained Church-Turing thesis cannot possibly be true

  2019cites this paper
• The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints

  2019cites this paper
• Less is more in the Fifties. Encounters between Logical Minimalism and Computer Design during the 1950s

  2019cites this paper
• Veridical data science

  2019cites this paper
• Which is the least complex explanation? Abduction and complexity

  2019cites this paper
• How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable

  2019cites this paper
• Computational Complexity 07 / 11 / 2019 Lecture 16 : Counting complexity

  2019cites this paper
• On the existence of stable and accurate neural networks for image reconstruction

  2019cites this paper
• Discovering Vulnerabilities in WebAssembly with Code Property Graphs

  2019cites this paper
• Definitively Identifying an Inherent Limitation to Actual Cognition

  2019influential citation
• A soft matter computer for soft robots

  2019cites this paper
• UNDERSTANDING QUANTUM COMPUTATION AND QUANTUM ANNEALING

  2019cites this paper
• Computing Spectral Measures and Spectral Types

  2019cites this paper
• Real Quadratic Julia Sets Can Have Arbitrarily High Complexity

  2019cites this paper
• Agency and the physics of numbers

  2018cites this paper
• Towards a general mathematical theory of experimental science

  2018cites this paper
• P vs NP

  2018cites this paper
• Incompleteness theorem for physics

  2018cites this paper
• Habilitation à diriger des recherches

  2018cites this paper
• Simplified and Yet Turing Universal Spiking Neural P Systems with Communication on Request

  2018cites this paper
• Mathematical Logic in Computer Science

  2018cites this paper
• Beyond imitation: Zero-shot task transfer on robots by learning concepts as cognitive programs

  2018cites this paper
• Quantum simulation experiments with superconducting circuits

  2018cites this paper
• OpenCollab: A Blockchain Based Protocol to Incentivize Open Source Software Development

  2017cites this paper
• Declarativeness: the work done by something else

  2017cites this paper
• The Algebraic View of Computation

  2017cites this paper
• Finite Computational Structures and Implementations: Semigroups and Morphic Relations

  2017cites this paper
• Embodying Computation at Higher Types

  2017cites this paper
• Computational intractability of attractors in the real quadratic family

  2017cites this paper
• Turing's pre-war analog computers

  2017cites this paper
• Almost Every Real Quadratic Polynomial has a Poly-time Computable Julia Set

  2017cites this paper
• Computable neighbourhoods of points in semicomputable manifolds

  2017cites this paper
• Cavity control as a new quantum algorithms implementation treatment

  2017cites this paper
• Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm

  2017cites this paper
• Real-time computability of real numbers by chemical reaction networks

  2017cites this paper
• Monoidal computer III: A coalgebraic view of computability and complexity

  2017cites this paper
• Reducibility of Computable Metrics on the Real Line

  2017cites this paper
• Epimenides, Gödel, Turing: an Eternal Gölden Tangle

  2016cites this paper
• Computer Representation of Music in the Research Environment

  2016cites this paper
• Informal Physical Reasoning Processes

  2016cites this paper
• Philosophy in the Face of Artificial Intelligence

  2016cites this paper
• Java generics are turing complete

  2016cites this paper
• Une nouvelle approche au General Game Playing dirigée par les contraintes. (Une nouvelle approche au General Game Playing dirigée par les contraintes)

  2016cites this paper
• A Framework for Algebraic Characterizations in Recursive Analysis

  2016cites this paper
• Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence

  2016cites this paper
• P is not equal to N P ∗

  2016cites this paper
• Degrees of Unsolvability: A Tutorial

  2015cites this paper
• The machine as data: a computational view of emergence and definability

  2015cites this paper