scientific article
From MaRDI portal
Publication:3916562
zbMath0465.03022MaRDI QIDQ3916562
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Church-Turing thesiscomputable functioneffective calculabilitynumber-theoretic functionscalculating machinemechanical calculating devices
Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10)
Related Items (47)
The `life machine': a quantum metaphor for living matter ⋮ Generalized Gandy-Păun-Rozenberg Machines for Tile Systems and Cellular Automata ⋮ What Is an Algorithm? ⋮ What is the Church-Turing Thesis? ⋮ Computable execution traces ⋮ Squeezing Feasibility ⋮ Unconventional Computing: Do We Dream Too Much? ⋮ A note on discreteness and virtuality in analog computing ⋮ Semantics of quantum programming languages: Classical control, quantum control ⋮ On mind \& Turing's machines ⋮ Computational processes, observers and Turing incompleteness ⋮ Semantics of computable physical models ⋮ Strict finitism and feasibility ⋮ The dependence of computability on numerical notations ⋮ An overview of quantum cellular automata ⋮ Can Church's thesis be viewed as a Carnapian explication? ⋮ Physical Computability Theses ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Execution trace sets for real computation ⋮ The concept of computability ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Semantics-to-Syntax Analyses of Algorithms ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Computation, hypercomputation, and physical science ⋮ Query languages for hierarchic databases ⋮ Concrete digital computation: what does it take for a physical system to compute? ⋮ \(p\)-adic physics, non-well-founded reality and unconventional computing ⋮ Supertasks do not increase computational power ⋮ Unnamed Item ⋮ Is there any real substance to the claims for a ``new computationalism? ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ Randomness and Determination, from Physics and Computing towards Biology ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ Informal and absolute proofs: some remarks from a Gödelian perspective ⋮ Properties of the atoms in finitely supported structures ⋮ The computational status of physics ⋮ Mathematical and Technological Computability ⋮ A game-semantic model of computation ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮ What is computation? ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Contractive intertwining dilations and norm approximation techniques ⋮ A Survey on Analog Models of Computation ⋮ Péter on Church's thesis, constructivity and computers ⋮ Constructive mathematics, Church's thesis, and free choice sequences
This page was built for publication:
