The Developments of the Concept of Machine Computability from 1936 to the 1960s

DOI10.1007/978-94-017-9217-2_2zbMath1336.03002OpenAlexW258260378MaRDI QIDQ5250213

Jean Mosconi

Publication date: 19 May 2015

Published in: Logic, Epistemology, and the Unity of Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-94-017-9217-2_2

zbMATH Keywords

Turing machinetheory of computationrecursive functions

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Turing machines and related notions (03D10) History of computer science (68-03)

Related Items

Péter on Church's thesis, constructivity and computers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analysis of Turing's The word problem in semi-groups with cancellation
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The decision problem for exponential diophantine equations
• On investigations on some algorithmic problems in algebra and number theory
• Some definitional suggestions for automata theory
• Turing-machines and the Entscheidungsproblem
• The word problem in semi-groups with cancellation
• Automata Studies. (AM-34)
• Varianten von Turingmaschinen
• Universal turing machines: An exercise in coding
• Eine Abstrakte Programmgesteuerte Rechenmaschine
• How to Program an Infinite Abacus
• The theory of recursive functions, approaching its centennial
• Kolmogorov and mathematical logic
• Observations About the Development of Theoretical Computer Science
• Origins of Recursive Function Theory
• Recursive Unsolvability of a problem of Thue
• On the definition of an algorithm
• On the Computational Complexity of Algorithms
• Turing machines with restricted memory access
• GRAPHSCHEMATA UND REKURSIVE FUNKTIONEN
• Computability and Recursion
• An Informal Arithmetical Approach to Computability and Computation
• Computability of Recursive Functions
• On Computable Numbers, with an Application to the Entscheidungsproblem
• A logical calculus of the ideas immanent in nervous activity
• Formal Reductions of the General Combinatorial Decision Problem
• Recursively enumerable sets of positive integers and their decision problems
• Turing‐Maschinen und Markowsche Algorithmen
• The word problem
• Philosophy of mathematics

This page was built for publication: The Developments of the Concept of Machine Computability from 1936 to the 1960s