Relevant bibliographies by topics / Church-Turing thesis

Academic literature on the topic 'Church-Turing thesis'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Church-Turing thesis.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Church-Turing thesis"

1

Copeland, B. Jack, and Oron Shagrir. "The Church-Turing thesis." Communications of the ACM 62, no. 1 (December 19, 2018): 66–74. http://dx.doi.org/10.1145/3198448.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Piccinini, Gualtiero. "Computationalism, The Church–Turing Thesis, and the Church–Turing Fallacy." Synthese 154, no. 1 (January 2007): 97–120. http://dx.doi.org/10.1007/s11229-005-0194-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

BEGGS, EDWIN, JOSÉ FÉLIX COSTA, DIOGO POÇAS, and JOHN V. TUCKER. "AN ANALOGUE-DIGITAL CHURCH-TURING THESIS." International Journal of Foundations of Computer Science 25, no. 04 (June 2014): 373–89. http://dx.doi.org/10.1142/s0129054114400012.

Full text
Abstract:
We argue that dynamical systems involving discrete and continuous data can be modelled by Turing machines with oracles that are physical processes. Using the theory introduced in Beggs et al. [2,3], we consider the scope and limits of polynomial time computations by such systems. We propose a general polynomial time Church-Turing Thesis for feasible computations by analogue-digital systems, having the non-uniform complexity class BPP//log* as theoretical upper bound. We show why BPP//log* should be replace P/poly, which was proposed by Siegelmann for neural nets [23,24]. Then we examine whether other sources of hypercomputation can be found in analogue-digital systems besides the oracle itself. We prove that the higher polytime limit P/poly can be attained via non-computable analogue-digital interface protocols.
APA, Harvard, Vancouver, ISO, and other styles
4

Cleland, Carol E. "Is the Church-Turing thesis true?" Minds and Machines 3, no. 3 (August 1993): 283–312. http://dx.doi.org/10.1007/bf00976283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cotogno, Paolo. "Hypercomputation and the Physical Church‐Turing Thesis." British Journal for the Philosophy of Science 54, no. 2 (June 1, 2003): 181–223. http://dx.doi.org/10.1093/bjps/54.2.181.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yao, Andrew Chi-Chih. "Classical physics and the Church--Turing Thesis." Journal of the ACM 50, no. 1 (January 2003): 100–105. http://dx.doi.org/10.1145/602382.602411.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sprevak, Mark D. "Kripke’s paradox and the Church–Turing thesis." Synthese 160, no. 2 (November 11, 2006): 285–95. http://dx.doi.org/10.1007/s11229-006-9120-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mikkilineni, Rao. "Going beyond Church–Turing Thesis Boundaries: Digital Genes, Digital Neurons and the Future of AI." Proceedings 47, no. 1 (May 11, 2020): 15. http://dx.doi.org/10.3390/proceedings2020047015.

Full text
Abstract:
The Church–Turing thesis deals with computing functions that are described by a list of formal, mathematical rules or sequences of event-driven actions such as modeling, simulation, business workflows, etc. All algorithms that are Turing computable fall within the boundaries of the Church–Turing thesis. There are two paths to pushing the boundaries. The first is to address the limitation in the clause “ignoring resource limitations”. The second is to search for computing models that solve problems that no ordinary Turing machine can solve using superrecursive algorithms. We argue that “structural machines” provide a new solution to managing both without disrupting the computation itself.
APA, Harvard, Vancouver, ISO, and other styles
9

Mikkilineni, Rao. "Going beyond Church–Turing Thesis Boundaries: Digital Genes, Digital Neurons and the Future of AI." Proceedings 47, no. 1 (May 11, 2020): 15. http://dx.doi.org/10.3390/proceedings47010015.

Full text
Abstract:
The Church–Turing thesis deals with computing functions that are described by a list of formal, mathematical rules or sequences of event-driven actions such as modeling, simulation, business workflows, etc. All algorithms that are Turing computable fall within the boundaries of the Church–Turing thesis. There are two paths to pushing the boundaries. The first is to address the limitation in the clause “ignoring resource limitations”. The second is to search for computing models that solve problems that no ordinary Turing machine can solve using superrecursive algorithms. We argue that “structural machines” provide a new solution to managing both without disrupting the computation itself.
APA, Harvard, Vancouver, ISO, and other styles
10

Piccinini, Gualtiero. "The Physical Church–Turing Thesis: Modest or Bold?" British Journal for the Philosophy of Science 62, no. 4 (December 1, 2011): 733–69. http://dx.doi.org/10.1093/bjps/axr016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Church-Turing thesis"

1

Krebs, Peter R. History &amp Philosophy of Science UNSW. "Turing machines, computers and artificial intelligence." Awarded by:University of New South Wales. History & Philosophy of Science, 2002. http://handle.unsw.edu.au/1959.4/19053.

Full text
Abstract:
This work investigates some of the issues and consequences for the field of artificial intelligence and cognitive science, which are related to the perceived limits of computation with current digital equipment. The Church -Turing thesis and the specific properties of Turing machines are examined and some of the philosophical 'in principle' objections, such as the application of G??del's incompleteness theorem, are discussed. It is argued that the misinterpretation of the Church-Turing thesis has led to unfounded assumptions about the limitations of computing machines in general. Modern digital computers, which are based on the von Neuman architecture, can typically be programmed so that they interact effectively with the real word. It is argued that digital computing machines are supersets of Turing machines, if they are, for example, programmed to interact with the real world. Moreover, computing is not restricted to the domain of discrete state machines. Analog computers and real or simulated neural nets exhibit properties that may not be accommodated in a definition of computing, which is based on Turing machines. Consequently, some of the philosophical 'in principle' objections to artificial intelligence may not apply in reference to engineering efforts in artificial intelligence.
APA, Harvard, Vancouver, ISO, and other styles
2

Almeida, João Paulo da Cruz [UNESP]. "Indução finita, deduções e máquina de Turing." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/151718.

Full text
Abstract:
Submitted by JOÃO PAULO DA CRUZ ALMEIDA (joaopauloalmeida2010@gmail.com) on 2017-09-26T16:20:50Z No. of bitstreams: 1 Minha Dissertação.pdf: 1021011 bytes, checksum: 1717c0a1baae32699bdf06c781a9ed31 (MD5)
Approved for entry into archive by Monique Sasaki (sayumi_sasaki@hotmail.com) on 2017-09-28T12:58:50Z (GMT) No. of bitstreams: 1 almeida_jpc_me_sjrp.pdf: 1021011 bytes, checksum: 1717c0a1baae32699bdf06c781a9ed31 (MD5)
Made available in DSpace on 2017-09-28T12:58:50Z (GMT). No. of bitstreams: 1 almeida_jpc_me_sjrp.pdf: 1021011 bytes, checksum: 1717c0a1baae32699bdf06c781a9ed31 (MD5) Previous issue date: 2017-06-29
Este trabalho apresenta uma proposta relacionada ao ensino e prática do pensamento dedutivo formal em Matemática. São apresentados no âmbito do conjunto dos números Naturais três temas essencialmente interligados: indução/boa ordem, dedução e esquemas de computação representados pela máquina teórica de Turing. Os três temas se amalgamam na teoria lógica de dedução e tangem os fundamentos da Matemática, sua própria indecidibilidade e extensões / limites de tudo que pode ser deduzido utilizando a lógica de Aristóteles, caminho tão profundamente utilizado nos trabalhos de Gödel, Church, Turing, Robinson e outros. São apresentadas inúmeros esquemas de dedução referentes às “fórmulas” e Teoremas que permeiam o ensino fundamental e básico, com uma linguagem apropriada visando treinar os alunos (e professores) para um enfoque mais próprio pertinente à Matemática.
This work deals with the teaching and practice of formal deductive thinking in Mathematics. Three essentially interconnected themes are presented within the set of Natural Numbers: induction, deduction and computation schemes represented by the Turing theoretical machine. The three themes are put together into the logical theory of deduction and touch upon the foundations of Mathematics, its own undecidability and the extent / limits of what can be deduced by using Aristotle's logic, that is the subject in the works of Gödel, Church, Turing, Robinson, and others. There are a large number of deduction schemes referring to the "formulas" and Theorems that are usual subjects in elementary and basic degrees of the educational field, with an appropriate language in order to train students (and teachers) for a more pertinent approach to Mathematics.
APA, Harvard, Vancouver, ISO, and other styles
3

Pissavin, Patrice. "De quoi les "théorèmes de limitation des formalismes" : théorèmes de Gödel de 1931 et apparentés, sont-ils la limitation?" Thesis, Paris 1, 2019. http://www.theses.fr/2019PA01H212.

Full text
Abstract:
Nous cherchons à définir la nature des limitations révélées par les « théorèmes de limitation des formalismes » (Théorèmes de Gödel de 1931, de Church de 1936, et de Turing de 1936-1937). Pour répondre à cette question, nous avons retenu comme fil conducteur Je programme de Hilbert (au sens large) : d'une part la réponse qu'Hilbert espérait apporter au problème des fondements, d'autre part la justification qu'il espérait apporter à l'absence de problèmes mathématiques insolubles. Cela nous a d'abord conduit à proposer une interprétation précise des deux aspects de ce programme. Nous avons ensuite analysé les propositions variées qui ont été faites en réponse à ce programme, incluant en particulier celle de Michael Detlefsen, tout en prenant en compte les résultats d'indécidabilité arithmétiques qui ont été obtenus dans les années 1970. Nous avons pour cela effectué une analyse détaillée de la thèse de Church-Turing. Nous avons également discuté les différentes positions qui ont été défendues dans le cadre du débat induit par l'argument de Lucas-Penrose. Nous avons enfin discuté les réponses que Post, Myhill et Ladrière ont successivement apportées à la question générale posée. Sur la base de l'ensemble de cette analyse, notre propre réponse est que les ces théorèmes mettent en évidence une certaine relativité associée au recours à la formalisation elle-même, qui se caractérise par un ancrage nécessaire bien circonscrit dans la pratique empirique des mathématiques informelles
We want to define the limitations content revealed by the theorems of formalisms limitation (Godel's theorems of 1931, Church's theorem of 1936 and Turing's theorem of 1936-1937). In order to answer this question, we have accepted as main theme Hilbert' s program (in the broad sense) : on the one hand, the answer that Hilbert hoped to give to foundations problem, and on the other hand, the justification he hoped to give to the lack of insoluble mathematical problems. This first lead us to propose a precise interpretation of the two aspects of this program. We have then analyzed the various proposals which have been given in answer this program, including in particular Michael Detlefsen'one, taking into account arithmetical indecidability results obtained in the 1970's. In this aim we have made a detailed analysis of Church-Turing's thesis. We have also discussed the different positions which have been held within the framework induced by Lucas-Penrose's argument. We have then discussed Post, Myhill and Ladrière's successively answers given to the general question asked. On the basis on this whole analysis, our own answer is that these theorems show a kind of relativity in relation with the use of formalization itself, which must be rooted in a confined part of the empirical practice of informal mathematics
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Church-Turing thesis"

1

Shagrir, Oron. Advertisement for the Philosophy of the Computational Sciences. Edited by Paul Humphreys. Oxford University Press, 2015. http://dx.doi.org/10.1093/oxfordhb/9780199368815.013.3.

Full text
Abstract:
This chapter deals with those fields that study computing systems. Among these computational sciences are computer science, computational cognitive science, computational neuroscience, and artificial intelligence. In the first part of the chapter, it is shown that there are varieties of computation, such as human computation, algorithmic machine computation, and physical computation. There are even varieties of versions of the Church-Turing thesis. The conclusion is that different computational sciences are often about different kinds of computation. The second part of the chapter discusses three specific philosophical issues. One is whether computers are natural kinds. Another issue is the nature of computational theories and explanations. The last section of the chapter relates remarkable results in computational complexity theory to problems of verification and confirmation.
APA, Harvard, Vancouver, ISO, and other styles
2

Tiwari, Sandip. Information mechanics. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198759874.003.0001.

Full text
Abstract:
Information is physical, so its manipulation through devices is subject to its own mechanics: the science and engineering of behavioral description, which is intermingled with classical, quantum and statistical mechanics principles. This chapter is a unification of these principles and physical laws with their implications for nanoscale. Ideas of state machines, Church-Turing thesis and its embodiment in various state machines, probabilities, Bayesian principles and entropy in its various forms (Shannon, Boltzmann, von Neumann, algorithmic) with an eye on the principle of maximum entropy as an information manipulation tool. Notions of conservation and non-conservation are applied to example circuit forms folding in adiabatic, isothermal, reversible and irreversible processes. This brings out implications of fluctuation and transitions, the interplay of errors and stability and the energy cost of determinism. It concludes discussing networks as tools to understand information flow and decision making and with an introduction to entanglement in quantum computing.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Church-Turing thesis"

1

Reus, Bernhard. "The Church-Turing Thesis." In Undergraduate Topics in Computer Science, 123–48. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-27889-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Çevik, Ahmet. "The Church-Turing Thesis." In Philosophy of Mathematics, 131–40. Boca Raton: Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003223191-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mauro, Luca San. "Church-Turing Thesis, in Practice." In Boston Studies in the Philosophy and History of Science, 225–48. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-93342-9_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Robič, Borut. "Computability (Church-Turing) Thesis Revisited." In The Foundations of Computability Theory, 315–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2020. http://dx.doi.org/10.1007/978-3-662-62421-0_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Franklin, Johanna N. Y. "A Church-Turing Thesis for Randomness?" In Lecture Notes in Computer Science, 217–26. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80049-9_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Goldin, Dina, and Peter Wegner. "The Church-Turing Thesis: Breaking the Myth." In New Computational Paradigms, 152–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11494645_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Davis, Martin. "The Church-Turing Thesis: Consensus and Opposition." In Logical Approaches to Computational Barriers, 125–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11780342_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Parikh, Rohit. "Is There a Church-Turing Thesis for Social Algorithms?" In Boston Studies in the Philosophy and History of Science, 339–57. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53280-6_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

White, G. Graham. "Pluralism Ignored: The Church-Turing Thesis and Philosophical Practice." In Language, Life, Limits, 373–82. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08019-2_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zurek, Wojciech H. "Algorithmic Information Content, Church — Turing Thesis, Physical Entropy, and Maxwell’s Demon." In Information Dynamics, 245–59. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4899-2305-9_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Church-Turing thesis"

1

Kundu, Shankhadip, Rajdeep Kundu, Shubhabrata Kundu, Anubhab Bhattachaijee, Sayantan Gupta, Souvik Ghosh, and Indranil Basu. "Quantum computation: From Church-Turing thesis to Qubits." In 2016 IEEE 7th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON). IEEE, 2016. http://dx.doi.org/10.1109/uemcon.2016.7777805.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Taylor, R. Gregory. "Motivating the Church-Turing thesis in the twenty-first century." In the 6th annual conference on the teaching of computing and the 3rd annual conference. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/282991.283551.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Church-Turing thesis' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography