Relevant bibliographies by topics / Turing machines

Academic literature on the topic 'Turing machines'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 July 2024

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 'Turing machines.'

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 "Turing machines"

1

Beggs, Edwin, José Félix Costa, Bruno Loff, and John V. Tucker. "Computational complexity with experiments as oracles." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464, no. 2098 (June 24, 2008): 2777–801. http://dx.doi.org/10.1098/rspa.2008.0085.

Full text
Abstract:
We discuss combining physical experiments with machine computations and introduce a form of analogue–digital (AD) Turing machine. We examine in detail a case study where an experimental procedure based on Newtonian kinematics is combined with a class of Turing machines. Three forms of AD machine are studied, in which physical parameters can be set exactly and approximately. Using non-uniform complexity theory, and some probability, we prove theorems that show that these machines can compute more than classical Turing machines.
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Dong-Sheng. "A local model of quantum Turing machines." Quantum Information and Computation 20, no. 3&4 (March 2020): 213–29. http://dx.doi.org/10.26421/qic20.3-4-3.

Full text
Abstract:
The model of local Turing machines is introduced, including classical and quantum ones, in the framework of matrix-product states. The locality refers to the fact that at any instance of the computation the heads of a Turing machine have definite locations. The local Turing machines are shown to be equivalent to the corresponding circuit models and standard models of Turing machines by simulation methods. This work reveals the fundamental connection between tensor-network states and information processing.
APA, Harvard, Vancouver, ISO, and other styles
3

Baeten, Jos C. M., Bas Luttik, and Paul van Tilburg. "Reactive Turing machines." Information and Computation 231 (October 2013): 143–66. http://dx.doi.org/10.1016/j.ic.2013.08.010.

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

Lisovik, L. P. "Structured Turing Machines." Cybernetics and Systems Analysis 40, no. 2 (March 2004): 162–68. http://dx.doi.org/10.1023/b:casa.0000034441.56723.a4.

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

Copeland, B. Jack. "Super Turing-machines." Complexity 4, no. 1 (September 1998): 30–32. http://dx.doi.org/10.1002/(sici)1099-0526(199809/10)4:1<30::aid-cplx9>3.0.co;2-8.

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

Burgin, Mark, and Eugene Eberbach. "Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms." Fundamenta Informaticae 91, no. 1 (2009): 53–77. http://dx.doi.org/10.3233/fi-2009-0033.

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

CALUDE, CRISTIAN S., and LUDWIG STAIGER. "A note on accelerated Turing machines." Mathematical Structures in Computer Science 20, no. 6 (November 8, 2010): 1011–17. http://dx.doi.org/10.1017/s0960129510000344.

Full text
Abstract:
In this paper we prove that any Turing machine that uses only a finite computational space for every input cannot solve an uncomputable problem even when it runs in accelerated mode. We also propose two ways to define the language accepted by an accelerated Turing machine. Accordingly, the classes of languages accepted by accelerated Turing machines are the closure under Boolean operations of the sets Σ1 and Σ2.
APA, Harvard, Vancouver, ISO, and other styles
8

Cabessa, Jérémie, and Hava T. Siegelmann. "The Computational Power of Interactive Recurrent Neural Networks." Neural Computation 24, no. 4 (April 2012): 996–1019. http://dx.doi.org/10.1162/neco_a_00263.

Full text
Abstract:
In classical computation, rational- and real-weighted recurrent neural networks were shown to be respectively equivalent to and strictly more powerful than the standard Turing machine model. Here, we study the computational power of recurrent neural networks in a more biologically oriented computational framework, capturing the aspects of sequential interactivity and persistence of memory. In this context, we prove that so-called interactive rational- and real-weighted neural networks show the same computational powers as interactive Turing machines and interactive Turing machines with advice, respectively. A mathematical characterization of each of these computational powers is also provided. It follows from these results that interactive real-weighted neural networks can perform uncountably many more translations of information than interactive Turing machines, making them capable of super-Turing capabilities.
APA, Harvard, Vancouver, ISO, and other styles
9

ROBINSON, RAPHAEL M. "MINSKY'S SMALL UNIVERSAL TURING MACHINE." International Journal of Mathematics 02, no. 05 (October 1991): 551–62. http://dx.doi.org/10.1142/s0129167x91000302.

Full text
Abstract:
Marvin L. Minsky constructed a 4-symbol 7-state universal Turing machine in 1962. It was first announced in a postscript to [2] and is also described in [3, Sec. 14.8]. This paper contains everything that is needed for an understanding of his machine, including a complete description of its operation. Minsky's machine remains one of the minimal known universal Turing machines. That is, there is no known such machine which decreases one parameter without increasing the other. However, Rogozhin [6], [7] has constructed seven universal machines with the following parameters: [Formula: see text] His 4-symbol 7-state machine is somewhat different from Minsky's, but all of his machines use a construction similar to that used by Minsky. The following corrections should be noted: First machine, for q 6 00Lq 1 read q 6 00Lq 7; second machine, for q 4 11Rq 4 read q 4 11Rq 10; last machine, for q 2 b 2 bLq 2 read [Formula: see text]. A generalized Turing machine with 4 symbols and 7 states, closely related to Minsky's, was constructed and used in [5].
APA, Harvard, Vancouver, ISO, and other styles
10

Mélès, Baptiste. "Les langages de Turing." Intellectica. Revue de l'Association pour la Recherche Cognitive 72, no. 1 (2020): 81–110. http://dx.doi.org/10.3406/intel.2020.1947.

Full text
Abstract:
Si les machines de Turing sont réputées inutilisables, c'est parce qu''on prête souvent davantage attention à la rudimentaire description initiale proposée par leur inventeur qu'à son souci constant d'adapter la syntaxe de leur description aux objectifs poursuivis. Nous décrirons chacun des langages successivement adoptés par Turing en en explicitant la grammaire, en justifiant chaque innovation syntaxique et en confrontant aux déclarations d'intention de Turing sa pratique effective. L'exposition de ces langages sera également éclairée, à titre pédagogique, par la théorie moderne des langages de programmation. Nous verrons ainsi que Turing a proposé trois familles de langages pour décrire le fonctionnement de ses machines : d'abord tout une pyramide de langages explicatifs («tables complètes» et «tables abrégées»), voués à rendre intelligible au lecteur humain le fonctionnement des machines ; puis un langage calculatoire, seul véritable «langage de programmation», permettant notamment l'exécution d''une description de machine par une autre machine ; enfin un langage démonstratif, réservé au mathématicien pour la mise au jour de propriétés des nombres calculables.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Turing machines"

1

Chen, Yin Fu. "SIMTM turing machine simulator." CSUSB ScholarWorks, 1995. https://scholarworks.lib.csusb.edu/etd-project/1229.

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

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
3

Davidsdottir, Agnes. "Algorithms, Turing machines and algorithmic undecidability." Thesis, Uppsala universitet, Algebra och geometri, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-441282.

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

Lin, Jack Chen-Hung. "Structural properties of one-tape Turing machines." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6125.

Full text
Abstract:
The model of Turing machines has been studied since its birth in 1936. Researchers have continuously proposed variants of such a model. Upon imposing different constraints, the power of each model varies or even remains the same, accordingly. Some well-known result (for example, the equivalence of finite state automata and one-tape linear-time deterministic Turing machines) has proven that the abilities of overwriting the tape content and scanning the tape content more than once cannot gain any advantage under certain restrictions. In this thesis, we study the behaviors and the fundamental properties of variants of one-tape Turing machines, such as deterministic, reversible, nondeterministic, probabilistic, and quantum Turing machines. This gives us a better understanding about the strength and the weakness of each machine type. For example, under the one-tape linear-time restriction, reversible, nondeterministic, co-nondeterministic, and bounded-error probabilistic computations recognize exactly regular languages whereas probabilistic and quantum Turing machines can recognize even non-regular languages.
APA, Harvard, Vancouver, ISO, and other styles
5

Michel, Pascal. "Etude de machines de turing et complexite algorithmique." Paris 7, 1992. http://www.theses.fr/1992PA077129.

Full text
Abstract:
La these est constituee de trois parties independantes. Premiere partie: comportement de quelques castors affaires et probleme ouvert en theorie des nombres. Un castor affaire est une machine de turing qui prend beaucoup de temps pour s'arreter quand elle part de la bande vide. Un lien est etabli entre le probleme de l'arret pour plusieurs castors affaires et le probleme de l'evolution des iterees d'une fonction definie par cas selon des congruences. Deuxieme partie: complexite de theories logiques contenant la relation de coprimalite. Des majorants sont donnes pour la complexite algorithmique de plusieurs theories logiques, dont la theorie de l'ensemble des naturels muni de la relation de coprimalite, avec ou sans la relation d'egalite. Troisieme partie : un langage np-complet accepte en temps lineaire par une machine de turing a une seule bande
APA, Harvard, Vancouver, ISO, and other styles
6

Atger, Dominique. "A Turing machines simulator using a Microsoft Windows' interface." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865965.

Full text
Abstract:
The purpose of this thesis is to develop a software system simulating Turing machines using a Microsoft Windows' Interface.Developed in the 1930's by Alan Turing and Emil Post, Turing machines are defined as "abstract computers" . These machines seem able to solve all problems a modern computer can solve, however complex the problems may be. A Turing machine is a basic computational model for algorithms.The software provides a practical tool to students with a relative notion of Turing machines. The software contains introduction and general information on Turing machines that gives the beginner enough background to use the program. The user can create, modify or run Turing machines saved onto MS-DOS files. Some examples of Turing machines are preloaded. These examples give more help to the beginner.An on-line help facility is provided in order to direct and inform the learning student at each level of the software.The Microsoft Windows' Interface makes the software easy and friendly to use. The software has the modularity which will ease any future enhancement.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
7

Goutefangea, Patrick. "Alan Turing : La "pensée" des machines et l'idée de pratique." Nantes, 1999. http://www.theses.fr/1999NANT3003.

Full text
Abstract:
La plausibilite de l'equivalence enoncee par la + these de church-turing ; entre procedure effective de calcul et procede mecanique repose sur la possibilite, pour une + machine universelle ;, de simuler les conditions intuitives du calcul chez un individu humain. En ce sens, la machine universelle renvoie a l'homme, non seulement en tant qu'il calcule, mais en tant qu'il est son createur : la machine doit pouvoir simuler les conditions de sa propre construction. Le + jeu de l'imitation ; imagine par turing a pour fonction d'etablir cette possibilite. Selon turing, l'adversaire humain de la machine au jeu de l'imitation peut etre surpris par celle-ci. Bien plus, il ne dispose d'aucun moyen de distinguer l'imprevisible auquel il est ainsi confronte de celui qu'il attend d'un individu humain dont il postule qu'il pense. L'adversaire humain de la machine est conduit au cours du jeu a faire comme si son interlocuteur mecanique etait pour lui un semblable, c'est-a-dire un autrui. Par la, l'hypothese d'une victoire de la machine au jeu de l'imitation fait appel a la problematique qui regit, dans une optique kantienne, l'examen des conditions de possibilite de la reconnaissance d'un autrui. C'est parce qu'il eleve son adversaire mecanique a la dignite du sujet kantien qu'un individu humain quelconque est defait au cours du jeu de l'imitation. Ainsi, dans le cadre de l'experience imaginee par turing, l'idee de sujet prend sens en tant que moment necessaire du processus d'enonciation-communication. Sous cet angle, l'hypothese de turing conduit a l'affirmation du primat, sur le sujet, du processus d'enonciation-communication. L'idee kantienne de pratique est alors bouleversee : elle contribue a la mise en forme du processus d'enonciation-communication, mais a travers l'erreur de l'adversaire humain de la machine. De sorte que c'est par la critique de sa propre histoire que l'idee philosophique de pratique est a meme de rendre compte du processus d'enonciation-communication
The plausibility of an equivalence, enunciated through the + church-turing's thesis ;, between effective procedure of calculus and mechanical procedure, is built on the possibility, for a + universal machine ;, to simulate the intuitive conditions of calculating for a human being. In that sense, the universal machine refers to man not only as he calculates, but also as he is its creator : the machine must be able to simulate the conditions of its own building. Establishing such a possibility is the role of the + imitation game ; proposed by turing. According to turing, a human individual can be surprised during the imitation game by the machine. Furthermore he does not have any means to distinguish the kind of surprise he feels in that case from the one he is expecting from a human individual about which he postulates that he is thinking. During the game, the human adversary of the machine is led to act as if the machine was for him a fellow creature, i. E. Another people. In this way, the machine's victory hypothesis requires the problematic which, from a kantian point of view, governs the study of the conditions of possibility to recognize not only another mind, but another people. A human individual is defeated during the imitation game because he tends to raise his mechanical adversary to the dignity of the kantian subject. Within the frame of the experiment imaginated by turing, the idea of subject takes sense as a necessary moment of the enunciation-communication process. In other words, the turing's hypothesis leads to state the primacy of the enunciation-communication process on the subject. The kantian idea of practice is altered : it takes part to the elaboration of the enunciation-communication process, but it does it through the human error. Then, it is through the critics of its own history that the philosophical idea of practice can explicit the enunciation-communication process. The idea of practice refers to the dynamics of its own criticizing
APA, Harvard, Vancouver, ISO, and other styles
8

Dalle, Vedove Nosaki Gregorio. "Chaos and Turing Machines on Bidimensional Models at Zero Temperature." Thesis, Bordeaux, 2020. http://www.theses.fr/2020BORD0309.

Full text
Abstract:
En mécanique statistique d'équilibre ou formalisme thermodynamique un des objectifs est de décrire le comportement des familles de mesures d'équilibre pour un potentiel paramétré par la température inverse. Nous considérons ici une mesure d'équilibre comme une mesure shift invariant qui maximise la pression. Il existe d'autres constructions qui prouvent le comportement chaotique de ces mesures lorsque le système se fige, c'est-à-dire lorsque la température tend vers zéro. Un des exemples les plus importants a été donné par Chazottes et Hochman où ils prouvent la non-convergence des mesures d'équilibre pour un potentiel localement constant lorsque la dimension est supérieure à 3. Dans ce travail, nous présentons une construction d'un exemple bidimensionnel décrit sur un alphabet fini et par un potentiel localement constant tel qu'il existe une séquence eta_k où la non-convergence est assurée pour toute suite de mesures d'équilibre à l'inverse de la température eta_k lorsque la température tend vers zéro. Pour cela nous utilisons la construction décrite par Aubrun et Sablik qui améliore le résultat de Hochman utilisé dans la construction de Chazottes et Hochman
In equilibrium statistical mechanics or thermodynamics formalism one of the main objectives is to describe the behavior of families of equilibrium measures for a potential parametrized by the inverse temperature. Here we consider equilibrium measure as the shift invariant measures that maximizes the pressure. Other constructions already prove the chaotic behavior of these measures when the system freezes, that is, when the temperature goes to zero. One of the most important examples was given by Chazottes and Hochman. They prove the non-convergence of the equilibrium measures for a locally constant potential when the dimension is bigger then 3. In this work we present a construction of a bidimensional example described by a finite alphabet and a locally constant potential there exists a sequence eta_k where the non-convergence occurs for any sequence of equilibrium measures at inverse of temperature eta_k when the temperature goes to zero. For that we use the construction described by Aubrun and Sablik which improves the result of Hochman used in the construction of Chazottes and Hochman
APA, Harvard, Vancouver, ISO, and other styles
9

Kalyanasundaram, Subrahmanyam. "Turing machine algorithms and studies in quasi-randomness." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42808.

Full text
Abstract:
Randomness is an invaluable resource in theoretical computer science. However, pure random bits are hard to obtain. Quasi-randomness is a tool that has been widely used in eliminating/reducing the randomness from randomized algorithms. In this thesis, we study some aspects of quasi-randomness in graphs. Specifically, we provide an algorithm and a lower bound for two different kinds of regularity lemmas. Our algorithm for FK-regularity is derived using a spectral characterization of quasi-randomness. We also use a similar spectral connection to also answer an open question about quasi-random tournaments. We then provide a "Wowzer" type lower bound (for the number of parts required) for the strong regularity lemma. Finally, we study the derandomization of complexity classes using Turing machine simulations. 1. Connections between quasi-randomness and graph spectra. Quasi-random (or pseudo-random) objects are deterministic objects that behave almost like truly random objects. These objects have been widely studied in various settings (graphs, hypergraphs, directed graphs, set systems, etc.). In many cases, quasi-randomness is very closely related to the spectral properties of the combinatorial object that is under study. In this thesis, we discover the spectral characterizations of quasi-randomness in two different cases to solve open problems. A Deterministic Algorithm for Frieze-Kannan Regularity: The Frieze-Kannan regularity lemma asserts that any given graph of large enough size can be partitioned into a number of parts such that, across parts, the graph is quasi-random. . It was unknown if there was a deterministic algorithm that could produce a parition satisfying the conditions of the Frieze-Kannan regularity lemma in deterministic sub-cubic time. In this thesis, we answer this question by designing an O(n[superscript]w) time algorithm for constructing such a partition, where w is the exponent of fast matrix multiplication. Even Cycles and Quasi-Random Tournaments: Chung and Graham in had provided several equivalent characterizations of quasi-randomness in tournaments. One of them is about the number of "even" cycles where even is defined in the following sense. A cycle is said to be even, if when walking along it, an even number of edges point in the wrong direction. Chung and Graham showed that if close to half of the 4-cycles in a tournament T are even, then T is quasi-random. They asked if the same statement is true if instead of 4-cycles, we consider k-cycles, for an even integer k. We resolve this open question by showing that for every fixed even integer k geq 4, if close to half of the k-cycles in a tournament T are even, then T must be quasi-random. 2. A Wowzer type lower bound for the strong regularity lemma. The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. Alon, Fischer, Krivelevich and Szegedy obtained a variant of the regularity lemma that allows one to have an arbitrary control on this measure of quasi-randomness. However, their proof only guaranteed to produce a partition where the number of parts is given by the Wowzer function, which is the iterated version of the Tower function. We show here that a bound of this type is unavoidable by constructing a graph H, with the property that even if one wants a very mild control on the quasi-randomness of a regular partition, then any such partition of H must have a number of parts given by a Wowzer-type function. 3. How fast can we deterministically simulate nondeterminism? We study an approach towards derandomizing complexity classes using Turing machine simulations. We look at the problem of deterministically counting the exact number of accepting computation paths of a given nondeterministic Turing machine. We provide a deterministic algorithm, which runs in time roughly O(sqrt(S)), where S is the size of the configuration graph. The best of the previously known methods required time linear in S. Our result implies a simulation of probabilistic time classes like PP, BPP and BQP in the same running time. This is an improvement over the currently best known simulation by van Melkebeek and Santhanam.
APA, Harvard, Vancouver, ISO, and other styles
10

Thathachar, Jayram S. "Time-space tradeoffs and functional representations via branching programs and their generalizations /." Thesis, Connect to this title online; UW restricted, 1998. http://hdl.handle.net/1773/6951.

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

Books on the topic "Turing machines"

1

Szepietowski, Andrzej. Turing machines with sublogarithmic space. Berlin: Springer-Verlag, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Arnold, Schönhage. Fast algorithms: A multitape Turing machine implementation. Mannheim: B.I. Wissenschaftsverlag, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rolf, Herken, ed. The Universal Turing machine: A half-centurysurvey. Oxford: Oxford University Press, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rolf, Herken, ed. The Universal Turing machine: A half-century survey. Oxford: Oxford University Press, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Szepietowski, Andrzej, ed. Turing Machines with Sublogarithmic Space. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58355-6.

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

R, Millican P. J., Clark Andy 1957-, and Turing Alan Mathison 1912-1954, eds. Machines and thought. Oxford: Oxford University Press, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Petzold, Charles. The annotated Turing: A guided tour through Alan Turing's historic paper on computability. Indianapolis, IN: Wiley Pub., 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jon, Barwise. Turing's World 3.0 for the Macintosh: An introduction to computability theory. Stanford, Calif: CSLI Publications, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Everingham, Mark R. Implementation of Turing machines as 2-D cellular automata. Manchester: University of Manchester, Department of Computer Science, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Canning, David. Rationality and game theory when players are Turing machines. London: International Centre for Economics and Related Disciplines, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Turing machines"

1

Jenkyns, Tom, and Ben Stephenson. "Turing Machines." In Undergraduate Topics in Computer Science, 397–411. London: Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4069-6_10.

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

Shen, A., and N. Vereshchagin. "Turing machines." In The Student Mathematical Library, 107–22. Providence, Rhode Island: American Mathematical Society, 2002. http://dx.doi.org/10.1090/stml/019/09.

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

Kitaev, A., A. Shen, and M. Vyalyi. "Turing machines." In Graduate Studies in Mathematics, 9–17. Providence, Rhode Island: American Mathematical Society, 2002. http://dx.doi.org/10.1090/gsm/047/03.

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

Morazán, Marco T. "Turing Machines." In Texts in Computer Science, 349–96. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43973-5_15.

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

Jenkyns, Tom, and Ben Stephenson. "Turing Machines." In Undergraduate Topics in Computer Science, 467–81. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70151-6_11.

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

Nakano, Keisuke. "Involutory Turing Machines." In Reversible Computation, 54–70. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-52482-1_3.

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

Baeten, Jos C. M., Bas Luttik, and Paul van Tilburg. "Reactive Turing Machines." In Fundamentals of Computation Theory, 348–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22953-4_30.

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

Burgin, Mark. "Inductive Turing Machines." In Encyclopedia of Complexity and Systems Science, 1–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-642-27737-5_682-1.

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

Asperti, Andrea, and Wilmer Ricciotti. "Formalizing Turing Machines." In Logic, Language, Information and Computation, 1–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32621-9_1.

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

Morita, Kenichi. "Reversible Turing Machines." In Monographs in Theoretical Computer Science. An EATCS Series, 103–56. Tokyo: Springer Japan, 2017. http://dx.doi.org/10.1007/978-4-431-56606-9_5.

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

Conference papers on the topic "Turing machines"

1

Arrathoon, R. "Optical Turing Machines." In 14th Congress of the International Commission for Optics, edited by Henri H. Arsenault. SPIE, 1987. http://dx.doi.org/10.1117/12.967134.

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

Ryoo, Michael S., Keerthana Gopalakrishnan, Kumara Kahatapitiya, Ted Xiao, Kanishka Rao, Austin Stone, Yao Lu, Julian Ibarz, and Anurag Arnab. "Token Turing Machines." In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2023. http://dx.doi.org/10.1109/cvpr52729.2023.01828.

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

Bojanczyk, Mikolaj, Bartek Klin, Slawomir Lasota, and Szymon Torunczyk. "Turing Machines with Atoms." In 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013). IEEE, 2013. http://dx.doi.org/10.1109/lics.2013.24.

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

Cavalheiro, Simone Andre da Costa, Antonio Carlos da Rocha Costa, and Gracaliz Pereira Dimuro. "Towards Developmental Turing Machines." In 2011 Workshop-School on Theoretical Computer Science (WEIT). IEEE, 2011. http://dx.doi.org/10.1109/weit.2011.18.

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

Li, Deyi, Yuchao Liu, Haisu Zhang, and Guisheng Chen. "Cloud computing beyond turing machines." In 2011 IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS). IEEE, 2011. http://dx.doi.org/10.1109/ccis.2011.6045093.

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

Morazán, Marco. "Composing Turing Machines in FSM." In SPLASH-E '23: 2023 ACM SIGPLAN International Symposium on SPLASH-E. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3622780.3623647.

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

Wiszniewski, Dorian, Richard Coyne, and Christopher Pierce. "Turing's Machines." In eCAADe 1999: Architectural Computing: From Turing to 2000. eCAADe, 1999. http://dx.doi.org/10.52842/conf.ecaade.1999.025.

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

Weng, Juyang. "Brains as naturally emerging turing machines." In 2015 International Joint Conference on Neural Networks (IJCNN). IEEE, 2015. http://dx.doi.org/10.1109/ijcnn.2015.7280838.

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

Weng, Juyang. "Brains as optimal emergent Turing Machines." In 2016 International Joint Conference on Neural Networks (IJCNN). IEEE, 2016. http://dx.doi.org/10.1109/ijcnn.2016.7727420.

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

Yongming Li. "Some Results of Fuzzy Turing Machines." In 2006 6th World Congress on Intelligent Control and Automation. IEEE, 2006. http://dx.doi.org/10.1109/wcica.2006.1713000.

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

Reports on the topic "Turing machines"

1

Garrard, K. P., L. W. Taylor, B. F. Knight, and R. J. Fornaro. Diamond turning machine controller implementation. Office of Scientific and Technical Information (OSTI), December 1988. http://dx.doi.org/10.2172/476633.

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

Estler, W. Tyler, and Edward B. Magrab. Validation metrology of the large optics diamond turning machine. Gaithersburg, MD: National Bureau of Standards, January 1985. http://dx.doi.org/10.6028/nbs.ir.85-3182.

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

Hayes, S. Displacement driven balancing of a diamond turning machine flycutter. Office of Scientific and Technical Information (OSTI), July 2021. http://dx.doi.org/10.2172/1810662.

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

Paredes, Juan Roberto, María Clara Ramos, Marina Robles, and Emma Näslund-Hadley. Energy Savings, Efficient Use, and Alternative Technologies. Inter-American Development Bank, April 2015. http://dx.doi.org/10.18235/0006241.

Full text
Abstract:
How much energy do you think is needed to light and mobilize all the machines and devices operating on the planet? Have you ever thought that by turning on a light in your house or school you are impacting the environment and emitting gases into the atmosphere?
APA, Harvard, Vancouver, ISO, and other styles
5

Baird, E. D., R. R. Donaldson, and S. R. Patterson. The laser interferometer system for the large optics diamond turning machine. Office of Scientific and Technical Information (OSTI), June 1999. http://dx.doi.org/10.2172/9646.

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

Siantar, M. Seismic Bracing Development for the Moore 3 Diamond Turning Machine at Lawrence Livermore National Laboratory. Office of Scientific and Technical Information (OSTI), May 2024. http://dx.doi.org/10.2172/2370174.

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

Lewin, Alex, Karla Diaz-Ordaz, Chris Bonell, James Hargreaves, and Edoardo Masset. Machine learning for impact evaluation in CEDIL-funded studies: an ex ante lesson learning paper. Centre for Excellence and Development Impact and Learning (CEDIL), April 2023. http://dx.doi.org/10.51744/llp3.

Full text
Abstract:
The Centre of Excellence for Development Impact and Learning (CEDIL) has recently funded several studies that use machine learning methods to enhance the inferences made from impact evaluations. These studies focus on assessing the impact of complex development interventions, which can be expected to have impacts in different domains, possibly over an extended period of time. These studiestherefore involve study participants being followed up at multiple time-points after the intervention, and typically collect large numbers of variables at each follow-up. The hope is that machine learning approaches can uncover new insights into the variation in responses to interventions, and possible causal mechanisms, which in turn can highlight potential areas that policy and planning can focus on. This paper describes these studies using machine learning methods, gives an overview of the common aims and methodological approaches used in impact evaluations, and highlights some lessons and important caveats.
APA, Harvard, Vancouver, ISO, and other styles
8

Hoffman, Wyatt. AI and the Future of Cyber Competition. Center for Security and Emerging Technology, January 2021. http://dx.doi.org/10.51593/2020ca007.

Full text
Abstract:
As states turn to AI to gain an edge in cyber competition, it will change the cat-and-mouse game between cyber attackers and defenders. Embracing machine learning systems for cyber defense could drive more aggressive and destabilizing engagements between states. Wyatt Hoffman writes that cyber competition already has the ingredients needed for escalation to real-world violence, even if these ingredients have yet to come together in the right conditions.
APA, Harvard, Vancouver, ISO, and other styles
9

Alonso-Robisco, Andrés, José Manuel Carbó, and José Manuel Carbó. Machine Learning methods in climate finance: a systematic review. Madrid: Banco de España, February 2023. http://dx.doi.org/10.53479/29594.

Full text
Abstract:
Preventing the materialization of climate change is one of the main challenges of our time. The involvement of the financial sector is a fundamental pillar in this task, which has led to the emergence of a new field in the literature, climate finance. In turn, the use of Machine Learning (ML) as a tool to analyze climate finance is on the rise, due to the need to use big data to collect new climate-related information and model complex non-linear relationships. Considering the proliferation of articles in this field, and the potential for the use of ML, we propose a review of the academic literature to assess how ML is enabling climate finance to scale up. The main contribution of this paper is to provide a structure of application domains in a highly fragmented research field, aiming to spur further innovative work from ML experts. To pursue this objective, first we perform a systematic search of three scientific databases to assemble a corpus of relevant studies. Using topic modeling (Latent Dirichlet Allocation) we uncover representative thematic clusters. This allows us to statistically identify seven granular areas where ML is playing a significant role in climate finance literature: natural hazards, biodiversity, agricultural risk, carbon markets, energy economics, ESG factors & investing, and climate data. Second, we perform an analysis highlighting publication trends; and thirdly, we show a breakdown of ML methods applied by research area.
APA, Harvard, Vancouver, ISO, and other styles
10

Booth, Steven Richard, Timothy Grant Dinehart, and Faith Ann Benson. Business Case Analysis for Replacing the Mazak 30Y Mill-Turn Machine in SM-39. Summary. Office of Scientific and Technical Information (OSTI), March 2015. http://dx.doi.org/10.2172/1171676.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Turing machines' for particular source types:
Journal articles Dissertations / Theses Books
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