Dissertations / Theses on the topic 'Turing machines'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research 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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Chen, Yin Fu. "SIMTM turing machine simulator." CSUSB ScholarWorks, 1995. https://scholarworks.lib.csusb.edu/etd-project/1229.
Full textKrebs, Peter R. History & 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 textDavidsdottir, 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 textLin, Jack Chen-Hung. "Structural properties of one-tape Turing machines." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6125.
Full textMichel, Pascal. "Etude de machines de turing et complexite algorithmique." Paris 7, 1992. http://www.theses.fr/1992PA077129.
Full textAtger, Dominique. "A Turing machines simulator using a Microsoft Windows' interface." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865965.
Full textDepartment of Computer Science
Goutefangea, Patrick. "Alan Turing : La "pensée" des machines et l'idée de pratique." Nantes, 1999. http://www.theses.fr/1999NANT3003.
Full textThe 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
Dalle, Vedove Nosaki Gregorio. "Chaos and Turing Machines on Bidimensional Models at Zero Temperature." Thesis, Bordeaux, 2020. http://www.theses.fr/2020BORD0309.
Full textIn 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
Kalyanasundaram, Subrahmanyam. "Turing machine algorithms and studies in quasi-randomness." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42808.
Full textThathachar, 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 textAraújo, Anderson. "Uma abordagem modelo-teórica da computabilidade de Turing clássica." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/281062.
Full textTese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas
Made available in DSpace on 2018-08-17T17:02:46Z (GMT). No. of bitstreams: 1 Araujo_Anderson_D.pdf: 1286485 bytes, checksum: 1e51db7a5721f4affeaf8f512d23269e (MD5) Previous issue date: 2011
Resumo: Esta tese propõe uma nova abordagem da computabilidade de Turing clássica, denominada abordagem modelo-teórica. De acordo com essa abordagem, estruturas e teorias são associadas às máquinas de Turing a fim de investigar as características de suas computações. Uma abordagem modelo-teórica da computabilidade de Turing através da lógica de primeira ordem é desenvolvida, e resultados de correspondência, correção, representação e completude entre máquinas, estruturas e teorias de Turing são demonstrados. Nessa direção, os resultados obtidos a respeito de propriedades tais como estabilidade, absoluticidade, universalidade e logicidade enfatizam as potencialidades da computabilidade modelo-teórica de primeira ordem. Demonstra-se que a lógica subjacente às teorias de Turing é uma lógica minimal intuicio-nista, sendo capaz, inclusive, de internalizar um operador de negação clássico. As técnicas formuladas nesta tese permitem, sobretudo, investigar a computabilidade de Turing em modelos não-padrão da aritmética. Nesse contexto, uma nova perspectiva acerca do fenômeno de Tennenbaum e uma avaliação crítica da abordagem de Dershowitz e Gurevich da tese de Church-Turing sào apresentadas. Como conseqüência, postula-se um princípio de interna-lidade aritmética na computabilidade, segundo o qual o próprio conceito de computação é relativo ao modelo aritmético em que as máquinas de Turing operam. Assim, a tese unifica as caracterizações modelo-aritméticas do problema P versus NP existentes na literatura, revelando, por fim, uma barreira modelo-aritmética para a possibilidade de solução desse problema central em complexidade computacional no que diz respeito a certos métodos. Em sua totalidade, a tese sustenta que características cruciais do conceito de computação podem ser vislumbradas a partir da dualidade entre finitude e infinitude presente na distinção entre números naturais padrão e não-padrão
Abstract: This PhD thesis proposes a new approach to classical Turing computability, called a model-theoretic approach. In that approach, structures and theories are associated to Turing machines in order to study the characteristics of their computations. A model-theoretic approach to Turing computability through first-order logic is developed, and first results about correspondence, soundness, representation and completeness among Turing machines, structures and theories are proved. In this line, the results about properties as stability, absoluteness, universality and logicality emphasize the importance of the model-theoretic standpoint. It is shown that the underlying logic of Turing theories is a minimal intuicionistic logic, being able to internalize a classical negation operator. The techniques obtained in the present dissertation permit us to examine the Turing computability over nonstandard models of arithmetic as well. In this context, a new perspective about Tennenbaum's phenomenon and a critical evaluation of Dershowitz and Gurevich's account on Church-Turing's thesis are given. As a consequence, an arithmetic internality principle is postulated, according to which the concept of computation itself is relative to the arithmetic model that Turing machines operate. In this way, the dissertation unifies the existing model-arithmetic characterizations of the P versus NP problem, leading, as a by-product, to a model-arithmetic barrier to the solvability of that central problem in computational complexity with respect to certain techniques. As a whole, the dissertation sustains that crucial characteristics of the concept of computation may be understood from the duality between finiteness and infiniteness inherent within the distinction between standard and nonstandard natural numbers
Doutorado
Filosofia
Doutor em Filosofia
Durand, Bruno. "Automates cellulaires : réversibilité et complexité." Lyon 1, 1994. http://www.theses.fr/1994LYO10030.
Full textAlmeida, 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 textApproved 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.
Grabowski, Łukasz [Verfasser], Andreas [Akademischer Betreuer] Thom, and Thomas [Akademischer Betreuer] Schick. "On Turing machines, groupoids, and Atiyah problem / Łukasz Grabowski. Gutachter: Andreas Thom ; Thomas Schick. Betreuer: Andreas Thom." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2011. http://d-nb.info/1042968675/34.
Full textRaymundo, F., G. Quispe, and C. Raymundo-Ibañeez. "Heavy Object Lifting Platform to Correct Human Balance and Posture." IOP Publishing Ltd, 2019. http://hdl.handle.net/10757/656295.
Full textPortier, Natacha. "Complexité algébrique : stabilité polynomiale des corps différentiels & résolutions universelles pour des problèmes NP-complets." Lyon 1, 1998. http://www.theses.fr/1998LYO10240.
Full textTan, Sovanna. "Calcul et vérification parallèles de problèmes d'algèbre linéaire." Paris 11, 1994. http://www.theses.fr/1994PA112360.
Full textFeuillade, Guillaume. "Spécification logique de réseaux de Petri." Rennes 1, 2005. http://www.theses.fr/2005REN1S168.
Full textOuazzani, Sabrina. "Construction de liens entre algorithmique et logique par du calcul à temps infini." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT280.
Full textThis thesis is centred on the study of infinite time computations. Infinite time here means having a time axis indexed by ordinals — the ordinals are convenient objects along which we can count. The infinite time Turing machine model was introduced by Hamkins and Lewis in 2000. This model generalises the Turing machine computation model to ordinal time. In this model, stages are indexed by (countable) ordinals, even though the tape is indexed by the integers as in the classical model. This model can thus now have infinite strings as input. The main focus of this thesis is the study of some of the new and surprising behaviours that these machines exhibit. Naturally, the longer, i.e., the greater ordinal, the computations run, the more powerful the model is, i.e. it computes/recognizes more sets. If the computations run beyond certain ordinal times, new structural properties also appear. One of these properties is the existence of gaps in the halting times of the machines. When these gaps had been discovered, some first links had been established between these gaps and the admissible character of the ordinals starting them. Our approach uses algorithmics as a mean to emphasize the links between the logical properties of the ordinals involved and the computational properties of the infinite time Turing machines. Moreover, thanks to some specific algorithms, we discover and prove new properties of these gaps, leading to a better understanding of their structure. We show in particular that gaps can have precisely every possible writable ordinal size and that there are gaps whose length is greater or equal than their starting ordinal point. Until the first of such a gap, the gaps appear in increasing sizes. We also show that even if, before this special gap, admissible ordinals only appear at the beginning of gaps, the gaps structure becomes quite disordered beyond that point, with admissible ordinals appearing not only at the beginning but also inside some (huge) gaps
Agudelo, Juan Carlos Agudelo. "Computação paraconsistente : uma abordagem logica a computação quantica." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280061.
Full textTese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas
Made available in DSpace on 2018-08-14T17:27:49Z (GMT). No. of bitstreams: 1 Agudelo_JuanCarlosAgudelo_D.pdf: 1223911 bytes, checksum: 92e4a3e06e1921aefd3476374d0726f2 (MD5) Previous issue date: 2009
Resumo: Neste trabalho levantamos, e investigamos do ponto de vista conceitual, evidências de que a complexidade algorítmica pode ser vista como relativa à lógica. Propomos, para tanto, novos modelos de computação fundados sobre lógicas não-clássicas, estudando suas características quanto à expressabilidade computacional e eficiência. A partir desta visão, sugerimos um novo caminho para estudar a eficiência dos modelos de computação quântica, enfatizando a análise de uma lógica subjacente a tais modelos. O conteúdo da tese está estruturado da seguinte maneira: no primeiro capítulo apresentamos uma análise conceitual da noção de 'computação', indicando como este conceito tem mudado desde os trabalhos fundacionais da década de 1930, e discutindo se o conceito deve ser considerado como puramente físico, puramente lógicomatemático ou uma combinação de ambos. O Capítulo 2 introduz duas versões de 'máquinas de Turing paraconsistentes', usando sistemas lógicos diferentes e obtendo modelos com diferentes poderes computacionais (quanto à eficiência); tal resultado constitui uma primeira evidência a favor da relatividade lógica da computação que queremos defender. Outra evidência na mesma direção é apresentada no Capitulo 3, através da generalização dos circuitos booleanos para lógicas não-clássicas, em particular para a lógica paraconsistente mbC e para a lógica modal S5, e da análise do poder computacional de tais generalizações. O Capítulo 4 consiste numa introdução à computação quântica, para logo (no Capítulo 5) estabelecer algumas relações entre modelos de computação quântica e modelos de computação paraconsistente, de maneira a propor uma interpretação lógica dos modelos quânticos. No capítulo final (Capítulo 6) descrevemos várias relações entre mecânica quântica e lógica paraix consistente, relações estas que sugerem potencialidades com alto grau de relevância a respeito da abordagem paraconsistente dos fenômenos computacionais quânticos e que incitam a continuar explorando esta alternativa.
Abstract: This work provides evidences to view computational complexity as logic-relative, by introducing new models of computation through non-classical logics and by studying their features with respect to computational expressivity and efficiency. From this point of view, we suggest a new way to study the efficiency of quantum computational models consisting in the analysis of an underlying logic. The contents of the thesis is structured in the following way: the first chapter presents a conceptual analysis of the notion of 'computation', showing how this concept evolved since the decade of 1930 and discussing whether it can be considered a pure physical or a pure logic-mathematical concept, or a combination of both paradigms. Chapter 2 introduces two versions of 'paraconsistent Turing machines', by considering different logic systems and obtaining models with different computational capabilities (with respect to efficiency); such a result constitute a first evidence in favor of the logical relativity of computation that we are defending here. Another evidence in the same direction is presented in Chapter 3 through a generalization of boolean circuits to non-classical logics, particularly for the paraconsistent logic mbC and for the modal logic S5, and by analyzing the computational power of such generalizations. Chapter 4 consists in an introduction to quantum computation. This is used in Chapter 5 to establish some relationships between quantum and paraconsistent models of computation, in order to propose a logic interpretation of quantum models. The final chapter (Chapter 6) describes several connections between quantum mechanics and paraconsistent logic; such relationship suggests highly relevant potentialities in favor of the paraconsistent approach to quantum computation phenomena encouraging to continue exploring this alternative.
Doutorado
Logica
Doutor em Filosofia
Koiran, Pascal. "Puissance de calcul des réseaux de neurones artificiels." Lyon 1, 1993. http://www.theses.fr/1993LYO19003.
Full textMunnich, Nicolas. "Operational and categorical models of PCF : addressing machines and distributing semirings." Electronic Thesis or Diss., Paris 13, 2024. http://www.theses.fr/2024PA131015.
Full textDespite being introduced over 60 years ago, PCF remains of interest. Though the quest for a satisfactory fully abstract model of PCF was resolved around the turn of the millennium, new models of PCF still frequently appear in the literature, investigating unexplored avenues or using PCF as a lens or tool to investigate some other mathematical construct. In this thesis, we build upon our knowledge of models of PCF in two distinct ways: Constructing a brand new model, and building upon existing models. Addressing Machines are a relatively new type of abstract machine taking inspiration from Turing Machines. These machines have been previously shown to model the full untyped ?- calculus. We build upon these machines to construct Extended Addressing Machines (EAMs) and endow them with a type system. We then show that these machines can be used to obtain a new and distinct fully abstract model of PCF: We show that the machines faithfully simulatePCF in such a way that a PCF term terminates in a numeral exactly when the corresponding Extended Addressing Machine terminates in the same numeral. Likewise, we show that every typed Extended Addressing Machine can be transformed into a PCF program with the same observational behaviour. From these two results, it follows that the model of PCF obtained by quotienting typable EAMs by a suitable logical relation is fully abstract. There exist a plethora of sound categorical models of PCF, due to its close relationship with the ?-calculus. We consider two similar models (which are also models of Linear Logic) that are based on semirings: Weighted models, using semirings to quantify some internal value, and Multiplicity models, using semirings to linearly model functions (model the exponential !). We investigate the intersection between these two models by investigating the conditions under which two monads derived from specific semirings distribute. We discover that whether or not a semiring has an idempotent sum makes a large difference in its ability to distribute. Our investigation leads us to discover the notion of an unnatural distribution, which forms a monad on a Kleislicategory. Finally, we present precise conditions under which a particular distribution can form between two semirings
Park, Seongmin. "A hypertext learning system for theory of computation." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/897499.
Full textDepartment of Computer Science
Feuillade, Guillaume Pinchinat Sophie. "Spécification logique de réseaux de Petri." [S.l.] : [s.n.], 2005. ftp://ftp.irisa.fr/techreports/theses/2005/feuillade.pdf.
Full textMeyer, Antoine Caucal Didier. "Graphes infinis de présentation finie." [S.l.] : [s.n.], 2005. ftp://ftp.irisa.fr/techreports/theses/2005/meyer.pdf.
Full textLassègue, Jean. "L'intelligence artificielle et la question du continu : remarques sur le modèle de Turing." Phd thesis, Université de Nanterre - Paris X, 1994. http://tel.archives-ouvertes.fr/tel-00011541.
Full textOn décrit la notion de machine de Turing en tant que concept dans la théorie de la calculabilité. On étudie le contexte épistémologique dans lequel le concept est né dans les années trente : philosophiquement, la “querelle des fondements en mathématique”; mathématiquement, l'apparition des différents formalismes permettant de rendre compte de la calculabilité des fonctions, dont le formalisme de la machine de Turing.
On décrit dans la deuxième partie comment le concept de machine de Turing se transforme en modèle pour la théorie de la psychologie. La justification de cette transformation est étudiée à partir de l'expérience de pensée élaborée par Turing grâce au “jeu de l'imitation”. On interprète le sens de ce jeu d'un point de vue formaliste, probabiliste et psychologique. On finit par conclure à l'absence de “test de Turing” dans le jeu, contrairement à ce qui est cru généralement.
La troisième partie étudie la façon dont la notion de machine de Turing a servi de fondement à l'intelligence artificielle. Le modèle de Turing tel qu'il a été utilisé jusqu'à présent engendre deux types de théories dualistes de l'esprit : une théorie platonicienne et une théorie fonctionnaliste. On justifie une interprétation non-dualiste en mettant l'accent sur le rôle joué par le langage dans la constitution du modèle. On replace enfin le modèle dans une tradition historique plus large, qui va de C. Babbage à R. Thom.
Payet, Etienne. "Produit Synchronisé pour Quelques Classes de Graphes Infinis." Phd thesis, Université de la Réunion, 2000. http://tel.archives-ouvertes.fr/tel-00468099.
Full textAgudelo, Juan Carlos Agudelo. "Da computação paraconsistente a computação quantica." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/279515.
Full textDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas
Made available in DSpace on 2018-08-06T09:39:40Z (GMT). No. of bitstreams: 1 Agudelo_JuanCarlosAgudelo_M.pdf: 2515941 bytes, checksum: 58c117425f8731bb67cf3fc0e1181ad4 (MD5) Previous issue date: 2006
Resumo: As diferentes interpretações da mecânica quântica levanta sérios problemas filosóficos a respeito da natureza do mundo físico e do estatuto das teorias físicas. Tais interpretações desempenham um papel importante na compreensão dos modelos de computação quântica, e por sua vez os modelos de computação quântica abrem a possibilidade de se confrontar as teses filosóficas que se atrevem a responder a tais problemas. Apesar das relevantes e surpreendentes promessas de uso pragmático e tecnológico da computação quântica, não é por essa vereda que caminha este trabalho: o que aqui se oferece é um novo paradigma de computação (um modelo de computação baseado no paradigma paraconsistente), e se propõe uma nova interpretação da computação quântica através desse novo paradigma, dessa forma colaborando simultaneamente na discussão filosófica a respeito da noção de computabilidade e da mecânica quântica. O presente trabalho introduz a definição do que será chamado de modelo de máquinas de Turing paraconsistentes (MTPs). Tal modelo de computação é uma generalização do modelo clássico de máquinas de Turing. No modelo de máquinas de Turing paraconsistentes, diferentemente do modelo clássico, permite-se a execução de múltiplas instruções de mancha simultânea, dando lugar a multiplicidade de símbolos em diferentes casas da fita, multiplicidade de estados e multiplicidade dc posições da máquina. Considerando que tal multiplicidade de configurações, embora essencial nas MTPs pode ser interpretado como incoerências com respeito às máquinas de Turing clássicas, permite-se acrescentar condições de consistência e inconsistência na execução das instruções nas MTPs. o que servirá então para controlar o estado dc incoerência do sistema. Depois de apresentar o modelo de MTPs, são descritos os modelo de máquinas de Turing quânticas (MTQs) e o modelo dc circuitos quânticos (CQs), ambos introduzidos inicialmente por David Dcutsch. os quais são, respectivamente, generalizações do modelo de máquinas dc Turing clássicas e de circuitos boolcanos clássicos usando as leis da mecânica quântica. Finalmente, estabelecem-se relações entre o modelo de MTPs e os modelos de computação quântica, simulando algoritmos quânticos simples (um CQ que soluciona o chamado problema de Dcutsch e um CQ que soluciona o chamado problema de Deutsch-Josza) e mostrando que o paralelismo quântico, uma característica essencial da computação quântica., pode em alguns casos ser simulado por meio de MTPs. Dessa forma, apesar de o particular modelo de MTPs aqui apresentado ter algumas restrições na simulação de certas características da computação quântica, abre-se a possibilidade de se definir outros modelos de MTPs de maneira a simular tais características. Em resumo, o presente trabalho, na medida cm que oferece um novo paradigma de computação (a saber, a computação paraconsistente) e uma nova interpretação dos modelos de computação quântica (a saber, a interpretação da computação quântica através da computação paraconsistente) contribui para a discussão filosófica a respeito da interpretação dos modelos de computação quântica, e possivelmente da interpretação da própria mecânica quântica. Contudo, não menos importante é o fato de que, apesar de o presente trabalho não pretender se dedicar a questões puramente técnicas da computabilidade, ele de fato abre um imenso campo de investigação a respeito da computação relativizada à lógica e suas implicações - no caso presente, relativizada à lógica paraconsistente
Abstract: The interpretations of quantum mechanics open serious philosophical questions about the nature of the physical world and about the status of physical theories. Such interpretations play an important role in the understanding of models of quantum computing, and models of quantum computing, by their turn, open possibilities to confront and test philosophical theses that dare to address such problems. Although the promising pragmatic and technological applications of quantum computing, this work goes in another way: what is here offered is a new paradigm of computation based upon the pa-raconsistency paradigm, and a new interpretation of quantum computing through this model, in this way simultaneously collaborating in the philosophical discussion about the concepts of computability and of quantum mechanics. This work introduces the definition of what will be called the model of paraconsistent Turing machines (PTMs). Such computational model is a generalization of the classical model of Turing machines. In the PTMs model, differently from the classical Turing machines model, simultaneous execution of multiple instructions is allowed, giving rise to a multiplicity of symbols on different cells of the tape, multiplicity of machine states and multiplicity of machine positions. Such multiplicity of configurations, though essential in the PTMs. can be seen as incoherencies with respect to classical Turing machines: to compensate this, the PTMs permit to operate with consistency and inconsistency conditions to control the global state of incoherence of the system. After introducing the PTMs, the model of quantum Turing machines (QTMs) and the model of quantum circuits (QCs) arc presented. This models arc due to David Dcutsch and arc. respectively, generalizations of the model of classical Turing machines and the model of classical boolean circuits, using the laws of quantum mechanics. Finally, relations between the model of PTMs and models of quantum computing arc established, which permits to simulate simple quantum algorithms (a QC to solve the so called Dcutsch problem and a QC to solve the so called Dcutsch-Jozsa. problem) by PTMs. It is also shown that quantum parallelism, an essential characteristic of quantum computation, may be simulated in some cases by PTMs. Although the particular model of PTMs here presented has some restrictions in the capacity to simulate certain quantum computing characteristics, our work opens the possibility to define other PTM models which could simulate such characteristics. To sum up, the present work, while offering a new paradigm of computation (namely, parconsistent computation) and a new interpretation of quantum computing (namely, interpretation of quantum computation by means of paraconsistent computation) contributes to the philosophical discussion about the interpretation of quantum computation and of the quantum mechanics itself. However, not less important is the fact that, besides its lack of explicit intention towards tccnical questions of computability theory, opens a new line of research about the possibilities of logic-relativized computation and its implications- in the present case, relativized to paraconsistent logics
Mestrado
Logica
Mestre em Filosofia
De, La Cruz Anthony, Jaime Cardenas, and Leonardo Vinces. "Development of a Machine to Control the Level of Washing in Panca Chili Seeds." Universidad Peruana de Ciencias Aplicadas (UPC), 2021. http://hdl.handle.net/10757/653774.
Full textThe washing of Panca chili seeds requires innovative solutions that allow controlling this process. It is necessary to handle variables (conductivity, pH, colorimetry) in the face of the challenge of working with small seeds. At present, there are no machines that are dedicated to the washing of this type of seeds, since in many companies this work is done manually, which is not the one indicated because this technique cannot guarantee homogeneity in the seed washing. In addition, direct handling of this type of seeds can cause irritation to the eyes and skin of the person who maintains contact with the seeds. That is why, it is proposed to make a machine to scale by means of a motorized rotary agitator inside a tank, in order to guarantee the homogeneity of the mixture when washing seeds. The present work will allow to determine, among two different types of agitators (axial and radial), which type of agitator is the most efficient in the washing of seeds of Panca chili, to achieve this objective the measurement of pH and electrical conductivity to the water will be carried after the mixture, after stirring. Finally, the analysis of the tests performed on the mixture obtained and washed by each type of agitator allowed to identify the turbine-type radial agitator, like the one that obtained greater efficiency in the washing of seeds, with respect to the helical agitator and pallets, designed for development of this work, in turn, could also confirm that this type of palette with the conductivity control allows to guarantee the homogeneity of the mixture during washing. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.
Revisión por pares
Ben-Azza, Hussain. "Automates cellulaires et pavages vus comme des réseaux booléens." Lyon 1, 1995. http://www.theses.fr/1995LYO10235.
Full textLefevre, Jonas. "Protocoles de population : une hiérarchie des variantes. Calcul de couplages autostabilisants." Palaiseau, Ecole polytechnique, 2014. http://www.theses.fr/2014EPXX0068.
Full textAubert, Clément. "Logique linéaire et classes de complexité sous-polynominales." Paris 13, 2013. https://theses.hal.science/tel-00957653.
Full textCette recherche en informatique théorique construit de nouveaux ponts entre logique linéaire et théorie de la complexité. Elle propose deux modèles de machines abstraites qui permettent de capturer de nouvelles classes de complexité avec la logique linéaire, les classes des problèmes efficacement parallélisables (NC et AC) et celle des problèmes solutionnables avec peu d’espace, dans ses versions déterministes et non-déterministes (L et NL). La représentation des preuves de la logique linéaire comme réseaux de preuves est employée pour représenter efficacement le calcul parallèle des circuits booléens, y compris à profondeur constante. La seconde étude s’inspire de la géométrie de l’interaction, une délicate reconstruction de la logique linéaire à l’aide d’opérateurs d’une algèbre de von Neumann. Nous détaillons comment l’interaction d’opérateurs représentant des entiers et d’opérateurs représentant des programmes peut être reconnue nilpotente en espace logarithmique. Nous montrons ensuite comment leur itération représente un calcul effectué par des machines à pointeurs que nous définissons et que nous rattachons à d’autres modèles plus classiques. Ces deux études permettent de capturer de façon implicite de nouvelles classes de complexité, en dessous du temps polynomial
Toister, Yanai. "Photography from the Turin Shroud to the Turing Machine." Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14911.
Full textSkácel, Jiří. "Systémy převodníků." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255379.
Full textRicquebourg, Frédéric. "Archéologie de l'informatique." Lyon 3, 2008. https://scd-resnum.univ-lyon3.fr/out/theses/2008_out_ricquebourg_f.pdf.
Full textThe computer - computing and information processing digital electronics instrument - was born at the end of World War II in an American university lab who worked for the armed forces of this country. Unsafe materially, very large consumers of electricity, accessible and usable only by highly qualified and sort on the track personnel the first computer systems and software were for the most part designed to meet the specific needs of the military. Initially thought to be artificial equivalents to human brains, they occupied dozens of square feet on the ground, weighed tons while their cost was usually several hundred thousand dollars. As for their computing power, it was nothing less than pathetic compared to that which everyone can have nowadays. In about sixty years, the computer has literally conquered human societies by turning them so dramatically and so deeply that it is now commonly accepted to speak of digital revolution. Cheap, ultra-miniaturized, multiforme, powerful, globally networked, it is now absolutely everywhere, in all aspects of human existence. The computer has become so crucial to ourselves, our time and our economy that paradoxically we ended up not paying attention to it. After questioning its provenance, its logical and mathematical essence, we show how the computer, this prodigal son created and perfected in wartime by the powerful army-university-industry triangular, has continued to undergo dramatic qualitative and quantitative transformations while retroactively inducing remarkable transformations on institutions, groups and individuals in society. Through this archeology of computing we try to better understand the universal machine, its history and the computer science, in the hope of better understanding man and the world in which he lives today.
Meyer, Antoine. "Graphes infinis de présentation finie." Phd thesis, Université Rennes 1, 2005. http://tel.archives-ouvertes.fr/tel-00325707.
Full textCapuni, Ilir. "A fault-tolerant Turing machine." Thesis, Boston University, 2013. https://hdl.handle.net/2144/13608.
Full textThe Turing machine is the most studied universal model of computation. This thesis studies the question if there is a Turing machine that can compute reliably even when violations of its transition function occur independently of each other with some small probability. In this thesis, we prove the existence of a Turing machine that - with a polynomial overhead - can simulate any other Turing machine, even when it is subject to faults of the above type, thereby answering the question that was open for 25 years.
Zenil, Hector. "Une approche expérimentale à la théorie algorithmique de la complexité." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2011. http://tel.archives-ouvertes.fr/tel-00839374.
Full textMasum, Hassan Carleton University Dissertation Mathematics. "An exploration of turing machine based complexity." Ottawa, 1995.
Find full textMüller, Markus. "Quantum Kolmogorov complexity and the quantum turing machine." [S.l.] : [s.n.], 2007. http://opus.kobv.de/tuberlin/volltexte/2007/1655.
Full textRendell, P. "Turing machine universality of the game of life." Thesis, University of the West of England, Bristol, 2014. http://eprints.uwe.ac.uk/22323/.
Full textRenuka, Shivaswaroop R. "Development of models of CNC machines - EMCO VMC100 and EMCO TURN120P in virtual NC." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178046654.
Full textDubovský, Dávid. "Analýza rizik nástrojářské dílny." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2015. http://www.nusl.cz/ntk/nusl-232113.
Full textShah, Huma. "Deception-detection and machine intelligence in practical Turing tests." Thesis, University of Reading, 2010. http://centaur.reading.ac.uk/24768/.
Full textTantau, Till. "On structural similarities of finite automata and turing machine enumerability classes." [S.l.] : [s.n.], 2003. http://edocs.tu-berlin.de/diss/2003/tantau_till.pdf.
Full textPazienza, Giovanni Egidio. "Aspects of algorithms and dynamics of cellular paradigms." Doctoral thesis, Universitat Ramon Llull, 2008. http://hdl.handle.net/10803/9151.
Full textLos paradigmas celulares, como las redes neuronales celulares (CNN, en
inglés) y los autómatas celulares (CA, en inglés), son una excelente
herramienta de cálculo, al ser equivalentes a una maquina universal de
Turing. La introducción de la maquina universal CNN (CNN-UM, en
inglés) ha permitido desarrollar hardware cuyo núcleo computacional
funciona según la filosofía celular; dicho hardware ha encontrado
aplicación en varios campos a lo largo de la ultima década. Sin
embargo, hay aun muchas preguntas abiertas sobre como definir los
algoritmos de una CNN-UM y como estudiar la dinámica de los autómatas
celular. En esta tesis se tratan ambos problemas: primero se demuestra
que es posible acotar el espacio de los algoritmos para la CNN-UM y
explorarlo gracias a técnicas genéticas; segundo, se explican los
fundamentos del estudio de los CA por medio de la dinámica no lineal
(según la definición de Chua) y se ilustra como esta técnica ha
permitido encontrar resultados novedosos.
Cellular paradigms, like Cellular Neural Networks (CNNs) and Cellular Automata (CA) are an excellent tool to perform computation, since they are equivalent to a Universal Turing machine. The introduction of the Cellular Neural Network - Universal Machine (CNN-UM) allowed us to develop hardware whose computational core works according to the principles of cellular paradigms; such a hardware has found application in a number of fields throughout the last decade. Nevertheless, there are still many open questions about how to define algorithms for a CNN-UM, and how to study the dynamics of Cellular Automata. In this dissertation both problems are tackled: first, we prove that it is possible to bound the space of all algorithms of CNN-UM and explore it through genetic techniques; second, we explain the fundamentals of the nonlinear perspective of CA (according to Chua's definition), and we illustrate how this technique has allowed us to find novel results.
Wells, Andrew J. "The External Tape Hypothesis : a Turing machine based approach to cognitive computation." Thesis, London School of Economics and Political Science (University of London), 1994. http://etheses.lse.ac.uk/118/.
Full textYedidia, Adam. "A relatively small turing machine whose behavior is independent of set theory." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100680.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 79-80).
Since the definition of the Busy Beaver function by Radó in 1962, an interesting open question has been what the smallest value of n for which BB(n) is independent of ZFC. Is this n approximately 10, or closer to 1,000,000, or is it unfathomably large? In this thesis, I show that it is at most 340,943 by presenting an explicit description of a 340,943-state Turing machine Z with 1 tape and a 2-symbol alphabet whose behavior cannot be proved in ZFC, assuming ZFC is consistent. The machine is based on work of Harvey Friedman on independent statements involving order-invariant graphs. Ill In doing so, I give the first known upper bound on the highest provable Busy Beaver number in ZFC. I also present an explicit description of a 7,902-state Turing machine G that halts if and only if there's a counterexample to Goldbach's conjecture, and an explicit description of a 36,146-state Turing machine R that halts if and only if the Riemann hypothesis is false. In the process of creating G, R, and Z, I define a higher-level language, TMD, which is much more convenient than direct state manipulation, and explain in great detail the process of compiling this language down to a Turing machine description. TMD is a well-documented language that is optimized for parsimony over efficiency. This makes TMD a uniquely useful tool for creating small Turing machines that encode mathematical statements.
by Adam Yedidia
M. Eng.
Ахматов, Владислав Вікторович. "The evolution of artificial intelligence: from the Turing machine to Google DeepMind." Thesis, Київський національний університет технологій та дизайну, 2020. https://er.knutd.edu.ua/handle/123456789/15259.
Full textWang, Zhanchen. "Chatter analysis of machine tool systems in turning processes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/NQ63715.pdf.
Full text