Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Machine de turing.
Дисертації з теми "Machine de turing"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Machine de turing".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Chen, Yin Fu. "SIMTM turing machine simulator." CSUSB ScholarWorks, 1995. https://scholarworks.lib.csusb.edu/etd-project/1229.
Повний текст джерела
2
Toister, Yanai. "Photography from the Turin Shroud to the Turing Machine." Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14911.
Повний текст джерелаАнотація:
Photography has always been a migratory system of representation. Today, it is integrated into numerous systems, in a profusion of specialties, sub-disciplines and disciplines. Within many of these domains, the exponentially growing powers of information processing enable the manufacturing of images that are seemingly photographic, yet partly (or fully) synthetic. How do we define these images? Are traditional disciplinary accounts relevant? Photography’s cultural value is most often measured in terms of its products, the various kinds of pictures that it generates. Instead, photography can be interrogated by studying the dynamic relationships between its components: the electromagnetic, optical, mechanical, chemical and recently mathematical elements and procedures that combine as a process that produces images. This dissertation utilizes two metaphors for defining photography: the Turin Shroud and the Universal Turing Machine. The former is presented as a set of propositions that facilitate new understandings about the history and theory of photography. The latter is introduced as a conceptual model that expands the theory and philosophy of photography into new realms, most notably those of new media and media philosophy. In support of this novel exposition, and to more adequately portray the trajectory of photography’s reincarnation as a form of computation, various terms from Vilém Flusser’s philosophy are reinterpreted and further developed. Through these it is suggested that photography is a family of programs wherein both ‘analogue’ and ‘digital’ characteristics always coexist. These are not to be seen as mutually exclusive qualities but as complementary discursive modalities. Further, because photography has always had mathematical qualities and potentialities, the recent technological turmoil does not designate the ‘end’ of the medium, but rather its coming of age. Importantly, now that the medium of photography has become media, photographic images should no longer be understood as bearers of ontological qualities but only as epistemic containers.
3
Capuni, Ilir. "A fault-tolerant Turing machine." Thesis, Boston University, 2013. https://hdl.handle.net/2144/13608.
Повний текст джерелаАнотація:
Thesis (Ph.D.)--Boston University
PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.The 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.
4
Masum, Hassan Carleton University Dissertation Mathematics. "An exploration of turing machine based complexity." Ottawa, 1995.
Знайти повний текст джерела
5
Müller, Markus. "Quantum Kolmogorov complexity and the quantum turing machine." [S.l.] : [s.n.], 2007. http://opus.kobv.de/tuberlin/volltexte/2007/1655.
Повний текст джерела
6
Kalyanasundaram, Subrahmanyam. "Turing machine algorithms and studies in quasi-randomness." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42808.
Повний текст джерелаАнотація:
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.
7
Rendell, P. "Turing machine universality of the game of life." Thesis, University of the West of England, Bristol, 2014. http://eprints.uwe.ac.uk/22323/.
Повний текст джерелаАнотація:
This project proves universal computation in the Game of Life cellular automaton by using a Turing machine construction. Existing proofs of universality in the Game of Life rely on a counter machine. These machines require complex encoding and decoding of the input and output and the proof of universality for these machines by the Church Turing thesis is that they can perform the equivalent of a Turing machine. A proof based directly on a Turing machine is much more accessible. The computational power available today allows powerful algorithms such as HashLife to calculate the evolution of cellular automata patterns sufficiently fast that an efficient universal Turing machine can be demonstrated in a conveniently short period of time. Such a universal Turing machine is presented here. It is a direct simulation of a Turing machine and the input and output are easily interpreted. In order to achieve full universal behaviour an infinite storage media is required. The storage media used to represent the Turing machine tape is a pair of stacks. One stack representing the Turing tape to the left of the read/write head and one for the Turing tape to the right. Collision based construction techniques have been used to add stack cells to the ends of the stacks continuously. The continuous construction of the stacks is equivalent to the formatting of blank media. This project demonstrates that large areas of a cellular automata can be formatted in real time to perform complex functions.
8
Shah, Huma. "Deception-detection and machine intelligence in practical Turing tests." Thesis, University of Reading, 2010. http://centaur.reading.ac.uk/24768/.
Повний текст джерелаАнотація:
Deception-detection is the crux of Turing’s experiment to examine machine thinking conveyed through a capacity to respond with sustained and satisfactory answers to unrestricted questions put by a human interrogator. However, in 60 years to the month since the publication of Computing Machinery and Intelligence little agreement exists for a canonical format for Turing’s textual game of imitation, deception and machine intelligence. This research raises from the trapped mine of philosophical claims, counter-claims and rebuttals Turing’s own distinct five minutes question-answer imitation game, which he envisioned practicalised in two different ways: a) A two-participant, interrogator-witness viva voce, b) A three-participant, comparison of a machine with a human both questioned simultaneously by a human interrogator. Using Loebner’s 18th Prize for Artificial Intelligence contest, and Colby et al.’s 1972 transcript analysis paradigm, this research practicalised Turing’s imitation game with over 400 human participants and 13 machines across three original experiments. Results show that, at the current state of technology, a deception rate of 8.33% was achieved by machines in 60 human-machine simultaneous comparison tests. Results also show more than 1 in 3 Reviewers succumbed to hidden interlocutor misidentification after reading transcripts from experiment 2. Deception-detection is essential to uncover the increasing number of malfeasant programmes, such as CyberLover, developed to steal identity and financially defraud users in chatrooms across the Internet. Practicalising Turing’s two tests can assist in understanding natural dialogue and mitigate the risk from cybercrime.
9
Tantau, 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.
Повний текст джерела
10
Girardot, Johan. "Toward higher-order and many-symbol infinite time Turing machines." Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAX028.
Повний текст джерелаАнотація:
Ce travail traite des machines de Turing infinies (ITTM) telles que développées par Hamkins et Lewis au début des années 2000. Plus particulièrement il s'intéresse à leur généralisation. Un aspect notable de ces machines infinies est que, en comparaison du modèle classique de Turing, celles-ci sont presque aussi simple. Une ITTM a la même structure qu'une machine de Turing à trois rubans. Elle fait des calculs en temps ordinaux et à n'importe quelle étape, l'instantané de la machine permet de calculer, comme dans le modèle classique, l'instantané à l'étape suivant. Le seule différence est aux étapes limites: la tête de lecture est remise au début, la machine est dans un certain état spécial et la valeur de chaque cellule est la limite supérieure de l'historique de ses valeurs précédentes. Si le choix pour la tête de lecture et pour l'état limite sont d'une façon logique, le choix de la valeur limite pour les cellules peut apparaître arbitraire. Pourquoi pas une liminf ? Ou encore quelque chose de plus compliqué ? Finalement, la justification de cette règle limite est une corroboration : avec cette règle, Hamkins et Lewis ont montré que le modèle de machines qu'ils ont développé est robuste, puissant et se comporte bien.L'objectif est de proposer des règles limites différentes de la règle limsup produisant donc des généralisations de ce modèle de machines.%La plupart de preuves portant sur les ITTMs utilise une « machine universelle », c'est-à-dire une machine qui simule en parallèle toutes les autres ITTMs. Une une telle machine est en fait simple à définir ; mais cette simplicité est fortuite : il pourrait y avoir de nombreuses difficultés qui sont évitées grâce à plusieurs propriétés implicite des ITTMs. Nous avons ainsi mis en lumière un ensemble de quatre propriétés, satisfaites par la règle de limsup. Elles nous permettent de définir un concept plus général de machine simulationnelles : des modèles de machines dont la règle limite satisfait ces propriétés et pour lesquelles on prouve qu'il existe une machine universelle. Le premier résultat de ce travail est un théorème qui établit, pour ces modèles de machines auxquelles deux contraintes sont rajoutées, une égalité entre les temps de calcul et les ordinaux qui peuvent être écrits.Le second résultat principal se base sur ce premier résultat. Un corollaire immédiat de la première partie est le suivant : il n'existe que deux modèles de machines simulationnelles (et non pathologiques), à savoir les ITTM avec la règle limsup et leur symétrique avec la règle liminf. Ainsi, pour produire des machines infinies d'ordre supérieur, il faut construire des machines à n symboles. C'est le second résultat : nous avons construit un modèle de machines simulationnelles à 3 symboles, strictement plus puissant que celui des ITTMs et pour lequel nous parvenons à établir les principaux résultats mettant en relation les ITTMs avec la théorie des ensemblesThis thesis studies infinite time Turing machines (ITTM) as developed by Hamkins and Lewis at the beginning of the years 2000. In particular, it aims at providing new generalizations of this model of infinite computation, or the tools and the results to develop those.A notable aspect of this model of infinite computation is that it is simple enough when compared to the usual finite model of Turing machines: an ITTM has the same structure as a three tapes Turing machine, it computes through the ordinals and at any successor stage, the next snapshot of the machine is a function of its machine code and the actual snapshot, as done in the classical setting. The only difference being that, at limit, tape heads are back on their first cells, the state is set to some distinguished limit state and the value of any cell is set to the limit superior of its previous values. While the choices for the heads and the states at limit stages may appear somewhat canonical, the principal justification for the rule of the limsup is actually a corroboration: with this rule, Hamkins and Lewis showed how this produces a robust, powerful and well-behaved model of infinite computation.So this work was focused on devising limit rules that would yield more powerful but equally well-behaved models of generalized infinite Turing machines.Most of the proofs done on ITTMs use a universal machine: an ITTM which simulates in parallel all other ITTMs. It happens to be straightforward to define such an universal ITTM.But its definition is only fortuitously straightforward. This construction rests on strong but implicit properties of the limsup rule. Hence, we exhibit a set of four properties satisfied by the limsup rule that allow us to define the more general concept of simulational machine: a model of infinite machines whose machines compute with a limit rule that satisfy this set of four properties, for which we prove that there exists a universal machine. The first main result is that the machines in this class of infinite machines satisfy (with two other constraints) an important equality satisfied by the usual ITTM, relating the time of computations and the ordinals that are writable.The second main result builds on the previous result. An immediate corollary is the following: there exists only two 2-symbol simulational and "well-behaved" model of ITTM; namely the limsup ITTM and the liminf ITTM. So, to produce higher-order machines, we need to consider n-symbols machine. And this is the second result: we construct a 3-symbol ITTM, strictly more powerful that the previous one and for which we establish the same set-theoretic results that were established for it
11
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/.
Повний текст джерелаАнотація:
The symbol processing or "classical cognitivist" approach to mental computation suggests that the cognitive architecture operates rather like a digital computer. The components of the architecture are input, output and central systems. The input and output systems communicate with both the internal and external environments of the cognizer and transmit codes to and from the rule governed, central processing system which operates on structured representational expressions in the internal environment. The connectionist approach, by contrast, suggests that the cognitive architecture should be thought of as a network of interconnected neuron-like processing elements (nodes) which operates rather like a brain. Connectionism distinguishes input, output and central or "hidden" layers of nodes. Connectionists claim that internal processing consists not of the rule governed manipulation of structured symbolic expressions, but of the excitation and inhibition of activity and the alteration of connection strengths via message passing within and between layers of nodes in the network. A central claim of the thesis is that neither symbol processing nor connectionism provides an adequate characterization of the role of the external environment in cognitive computation. An alternative approach, called the External Tape Hypothesis (ETH), is developed which claims, on the basis of Turing's analysis of routine computation, that the Turing machine model can be used as the basis for a theory which includes the environment as an essential part of the cognitive architecture. The environment is thought of as the tape, and the brain as the control of a Turing machine. Finite state automata, Turing machines, and universal Turing machines are described, including details of Turing's original universal machine construction. A short account of relevant aspects of the history of digital computation is followed by a critique of the symbol processing approach as it is construed by influential proponents such as Allen Newell and Zenon Pylyshyn among others. The External Tape Hypothesis is then developed as an alternative theoretical basis. In the final chapter, the ETH is combined with the notion of a self-describing Turing machine to provide the basis for an account of thinking and the development of internal representations.
12
Yedidia, 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.
Повний текст джерелаАнотація:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.Cataloged 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.
13
Ахматов, Владислав Вікторович. "The evolution of artificial intelligence: from the Turing machine to Google DeepMind." Thesis, Київський національний університет технологій та дизайну, 2020. https://er.knutd.edu.ua/handle/123456789/15259.
Повний текст джерела
14
PINNA, SIMONE. "Extended cognition, dynamics, and algorithms. A turing machine based approach to the study of arithmetical skills." Doctoral thesis, Università degli Studi di Cagliari, 2014. http://hdl.handle.net/11584/266521.
Повний текст джерелаАнотація:
The fields of philosophy of mind and cognitive science have been characterized, in the last few
decades, by a growing interest for explanations of mind's activity in terms of interaction between
brains, bodies and the world. Embodiment, embeddedness, situatededness are key words that most
often can be found in contemporary cognitive studies. However, some cognitive activities seem
recalcitrant to this kind of treatment. Mathematical thinking is one of them. Explanations of human
computational competencies, indeed, focus typically on representational issues, while giving less
importance to the role of mind/body/environment interaction for the performance and development
of algorithmic skills, namely, those capacities which are essential in order to operate with numbers
and carry out symbolic transformation.
The significance of these skills for a general understanding of computational activities is explicitely
recognized in Alan Turing's theory of computation, which is focused on the construction of
idealized models of the mechanisms at work in a real cognitive system, namely the one consisting
of a man performing calculations with paper and pencil. In the present thesis I take seriously Marco
Giunti's proposal to use a Turing machine (TM)-based computational architecture, namely the
Bidimensional Turing Machine (BTM), in order to study human algorithmic skills.
This work consists of two main parts. The first part, philosophically-oriented, deals with Andrew
Wells' ecological interpretation of the TM's architecture and its relations with a set of philosophical
and psychological positions such as classic computationalism, the extended-mind hypothesis and
the dynamical approach to cognition; the second, more technical part, sets up a theoretical and
methodological framework for the development and justification of BTM-based models of human
algorithmic skills.
15
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.
Повний текст джерелаАнотація:
El texto completo de este trabajo no está disponible en el Repositorio Académico UPC por restricciones de la casa editorial donde ha sido publicado.The 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
16
Lima, Welton Dias de. "Computadores e mentes: uma analogia filosófica." Universidade do Vale do Rio dos Sinos, 2017. http://www.repositorio.jesuita.org.br/handle/UNISINOS/6692.
Повний текст джерелаАнотація:
Submitted by JOSIANE SANTOS DE OLIVEIRA (josianeso) on 2017-10-13T14:50:03Z
No. of bitstreams: 1
Welton Dias de Lima_.pdf: 1124831 bytes, checksum: 41ffb9304231eacf64174b11566c5ad8 (MD5)Made available in DSpace on 2017-10-13T14:50:03Z (GMT). No. of bitstreams: 1 Welton Dias de Lima_.pdf: 1124831 bytes, checksum: 41ffb9304231eacf64174b11566c5ad8 (MD5) Previous issue date: 2017-07-12
Nenhuma
O presente estudo teve o propósito de desenvolver uma revisão bibliográfica em um dos artigos mais importantes e polêmicos no campo da Ciência da Computação, “Computadores e Inteligência” (nome original: Computing Machinery and Intelligence). O texto foi escrito em 1950 por um dos maiores gênios da matemática, que mais tarde revolucionou o mundo, Alan Mathison Turing (1912-1954). A partir de sua percepção crítica, esse excelente trabalho científico contribuiu significativamente para o desenvolvimento do computador digital e também deu início aos primeiros passos para os estudos sobre Inteligência Artificial. A pesquisa teve como objetivos investigar os motivos que levaram Turing a escrever o artigo, destacar as principais contribuições do artigo aos diversos campos do conhecimento, fazer um estudo pormenorizado sobre a pergunta áurea do artigo “Pode uma máquina pensar?” e compreender as principais objeções filosóficas a sua posição. Após análise, constata-se que o artigo escrito por Turing está em dividido em três partes: (i) o jogo da Imitação e o computador digital; (ii) objeções filosóficas à inteligência artificial e, por último, (iii) máquinas que aprendem. Destarte, justifica-se o desenvolvimento da pesquisa na sistematização e compreensão do tema escolhido a partir da Filosofia da Mente. A importância do tema se mostra no interesse significativo da área da filosofia pelos questionamentos realizados, oriundos da área da inteligência artificial. Essas indagações refletem os interesses antagônicos dos pesquisadores em IA. As respostas a essas questões dependem de como é definido "inteligência" ou "consciência" e exatamente que ‘máquinas’ estão sob discussão. Para melhor compreensão do assunto, serão analisados os argumentos de John Turing, John Searle, entre outros pensadores.
The present paper offers a bibliographic review of one of the most important and controversial articles in the field of Computer Science, "Computers and Intelligence" (original title: Computing Machinery and Intelligence). The text was written in 1950 by one of the greatest mathematical geniuses who later revolutionized the world, Alan Mathison Turing (1912-1954). Turing’s excellent scientific work contributed significantly to the development of the digital computer and also gave rise to the first steps in the studies on Artificial Intelligence. The paper investigates the reasons that led Turing to write the article, highlights the main contributions of the article to various fields of knowledge, and provides a critical analysis of Turing’s answer to the question "Can a machine think?". My analysis reveals that Turing’s article can be divided into three parts: (i) the game of Imitation and the digital computer; (ii) philosophical objections and finally (iii) learning machines. Inquiries on these questions justified the development of the research in the uniformization and understanding of key issues in the Philosophy of the Mind. These inquiries reflect the opposing interests of AI researchers, as the answers to these questions depend on how "intelligence" or "consciousness" is defined and what exactly are the "machines" under discussion. For a better understanding of the subject, the arguments of Turing, John Searle, and other thinkers will be used.
17
Siska, Josef. "Simulátor Turingových strojů popsaných pomocí kompozitních diagramů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236100.
Повний текст джерелаАнотація:
In this thesis, the theory related to Turing machines and means of their description (with focus on composite diagrams) is presented. The aim of this work is to create an application that allows editing Turing machines described by means of composite diagrams and simulating their computation on specified input configuration (including non-deterministic and multi-tape machines). Furthermore, within the application it will be possible to run the termination analysis of Turing machine in order to determine whether this machine or any of its parts always halt. The resulting application is implemented in Java and the termination analysis is performed using the well-founded orders. And so, one of the results created during this work is a software tool which allows designing and testing of Turing machines described by means of composite diagrams. Resulting application may be used especially during lectures on theoretical computer science, where it can be used to demonstrate computation of some Turing machine.
18
Al-Shihi, Hamda D. A. "A transdisciplinary study of embodiment in HCI, AI and New Media." Thesis, University of Bradford, 2012. http://hdl.handle.net/10454/6330.
Повний текст джерелаАнотація:
The aim of this thesis is to report on a transdisciplinary approach, regarding the complexity of thinking about human embodiment in relation to machine embodiment. A practical dimension of this thesis is to elicit some principles for the design and evaluation of virtual embodiment. The transdisciplinary approach suggests, firstly, that a single discipline or reality is, on its own, not sufficient to explain the complexity and dynamism of the embodied interaction between the human and machine. Secondly, the thesis argues for thinking of transdisciplinary research as a process of individuation, becoming or transduction, that is, as a process of mediation between heterogeneous approaches rather than perceiving research as a stabilized cognitive schema designed to accumulate new outcomes to the already-there reality. Arguing for going beyond the individualized approaches to embodiment, this thesis analyzes three cases where the problems that appear in one case are resolved through the analysis of the following one. Consisting of three phases, this research moves from objective scientific ¿reality¿ to more phenomenological, subjective and complex realities. The first study employs a critical review of embodied conversational agents in human¿computer interaction (HCI) in a learning context using a comparative meta-analysis. Meta-analysis was applied because most of the studies for evaluating embodiment are experimental. A learning context was selected because the number of studies is suitable for meta-analysis and the findings could be generalized to other contexts. The analysis reveals that there is no ¿persona effect¿, that is, the expected positive effect of virtual embodiment on the participant¿s affective, perceptive and cognitive measures. On the contrary, it shows the reduction of virtual embodiment to image and a lack of consideration for the participant¿s embodiment and interaction, in addition to theoretical and methodological shortcomings. The second phase solves these problems by focusing on Mark Hansen¿s phenomenological account of embodiment in new media. The investigation shows that Hansen improves on the HCI account by focusing on the participant¿s dynamic interaction with new media. Nevertheless, his views of embodied perception and affection are underpinned by a subjective patriarchal account leading to object/subject and body/work polarizations. The final phase resolves this polarization by analyzing the controversial work of Alan Turing on intelligent machinery. The research provides a different reading of the Turing Machine based on Simondon¿s concept of individuation, repositioning its materiality from the abstract non-existent to the actual-virtual realm and investigating the reasons for its abstraction. It relates the emergence of multiple human¿machine encounters in Turing¿s work to the complex counter-becoming of what it describes as ¿the Turing Machine compound¿.Ministry of Higher Education in the Sultanate of Oman
19
Al-Shihi, Hamda Darwish Ali. "A transdisciplinary study of embodiment in HCI, AI and New Media." Thesis, University of Bradford, 2012. http://hdl.handle.net/10454/6330.
Повний текст джерелаАнотація:
The aim of this thesis is to report on a transdisciplinary approach, regarding the complexity of thinking about human embodiment in relation to machine embodiment. A practical dimension of this thesis is to elicit some principles for the design and evaluation of virtual embodiment. The transdisciplinary approach suggests, firstly, that a single discipline or reality is, on its own, not sufficient to explain the complexity and dynamism of the embodied interaction between the human and machine. Secondly, the thesis argues for thinking of transdisciplinary research as a process of individuation, becoming or transduction, that is, as a process of mediation between heterogeneous approaches rather than perceiving research as a stabilized cognitive schema designed to accumulate new outcomes to the already-there reality. Arguing for going beyond the individualized approaches to embodiment, this thesis analyzes three cases where the problems that appear in one case are resolved through the analysis of the following one. Consisting of three phases, this research moves from objective scientific 'reality' to more phenomenological, subjective and complex realities. The first study employs a critical review of embodied conversational agents in human-computer interaction (HCI) in a learning context using a comparative meta-analysis. Meta-analysis was applied because most of the studies for evaluating embodiment are experimental. A learning context was selected because the number of studies is suitable for meta-analysis and the findings could be generalized to other contexts. The analysis reveals that there is no 'persona effect', that is, the expected positive effect of virtual embodiment on the participant's affective, perceptive and cognitive measures. On the contrary, it shows the reduction of virtual embodiment to image and a lack of consideration for the participant's embodiment and interaction, in addition to theoretical and methodological shortcomings. The second phase solves these problems by focusing on Mark Hansen's phenomenological account of embodiment in new media. The investigation shows that Hansen improves on the HCI account by focusing on the participant's dynamic interaction with new media. Nevertheless, his views of embodied perception and affection are underpinned by a subjective patriarchal account leading to object/subject and body/work polarizations. The final phase resolves this polarization by analyzing the controversial work of Alan Turing on intelligent machinery. The research provides a different reading of the Turing Machine based on Simondon's concept of individuation, repositioning its materiality from the abstract non-existent to the actual-virtual realm and investigating the reasons for its abstraction. It relates the emergence of multiple human-machine encounters in Turing's work to the complex counter-becoming of what it describes as 'the Turing Machine compound'.
20
Kajan, Dušan. "Výpočetní historie Turingových strojů a jejich generování gramatikami s rozptýleným kontextem." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2015. http://www.nusl.cz/ntk/nusl-264935.
Повний текст джерелаАнотація:
The purpose of this thesis is to show a method, that would transform given Turing machine into propagating scattered context grammar, which language contains all valid computational histories of that particular Turing machine. Afterwards this thesis deals with questions arising from existence of such algorithm, especially in regards to the current knowledge about power of propagating scattered context grammars. Practical examples and implementation of proposed algorithm is also part of this thesis.
21
Krebs, 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.
Повний текст джерелаАнотація:
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.
22
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.
Повний текст джерела
23
Lin, Jack Chen-Hung. "Structural properties of one-tape Turing machines." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6125.
Повний текст джерелаАнотація:
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.
24
Liron, Romain. "Approche écologique dans la conception d’outils cognitifs dans le domaine administratif : application à l’artisanat du bâtiment." Thesis, Lorient, 2016. http://www.theses.fr/2016LORIL391/document.
Повний текст джерелаАнотація:
Ce travail adopte le cadre de l’ingénierie cognitive en vue de la conception et de l’évaluation d’outils cognitifs dans le domaine de l’administration d’entreprises artisanales. Ce cadre relève d’une approche dite écologique des systèmes de travail. L’objectif général de ce travail est double. D’une part, il s’agit de montrer la pertinence de cette approche écologique eu égard au domaine étudié et d’autre part, de proposer une interface utilisateur pour un système d’aide à la gestion administrative sur support numérique mobile. Plus précisément, nous proposons une modélisation du domaine de travail en considérant certaines de ses caractéristiques les plus complexes à modéliser : la récursivité et la dimension éthique. Ensuite, nous testons une méthode récente pour valider et vérifier cette modélisation (Task Machine Turing Analysis, TMTA). Nous proposons également une nouvelle méthode de validation et vérification d’un domaine de travail, dite méthode des « points de vue ». À partir d’un modèle du domaine de travail de la gestion administrative dans les entreprises artisanales, nous expérimentons plusieurs maquettes d’interfaces pour un système d’aide. Cette expérimentation nous permet de mesurer le degré d’application des principes dirigeant la conception d’interface écologique. Enfin, nous proposons et testons une maquette finale de systèmes à destination des artisansThis work adopts the cognitive engineering framework for the design and evaluation of cognitive tools interfaces in the administrative handicraft field. This framework relies on an ecological approach of work systems. The objectives of this work were twofold. First, it consisted in showing the heuristic value of the ecological approach. Second, we aimed at proposing a user interface for a mobile digital cognitive tool assisting administrative tasks. More precisely, we proposed to consolidate the work domain analysis framework by considering some of the more complex characteristics to model, that is to say recursion and the ethical dimension. Afterwards, we tested a recent method named “Turing Machine Task Analysis” to validate and verify the work domain model. We also proposed a new verification and validation method for work domain model, named “viewpoints method”. Based on a modeling of the administrative handicraft domain, we tested several user interface mockups for a cognitive tool. This experiment permitted us to measure the degree of application of the Ecological Interface Design principles. Finally, we proposed and tested a final mockup for craftsmen
25
Hladík, Zdeněk. "Multidimensionální automaty a jejich jazyky." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363808.
Повний текст джерелаАнотація:
This work includes brief overview of the theory behind two-dimentional languages which was the main theme examined in previous work. Based upon this theory there are next chapters introducing a new concept of three-dimentional and multi-dimentional languages. For each type of language there is a definition of corresponding type of strings and string operations. Finally, for each type of language there are definitions of developed formal gramatics and automata. Along with theory, in work there is an demonstration of developed program, which provides simulation of introduced multidimensional automata.
26
Dubovský, 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.
Повний текст джерелаАнотація:
This master`s thesis deals with a hazard analysis of selected machinery according to an actual legislative documents in Slovakia, which were taken over from Europien Union directives. The thesis is focused on exploring legislation related to the safety of toolroom workshop in the Czech Republic and Germany. Because of that was done the recherché of harmonized standards in these countries. Subsequently is made the identification of hazards under recherched standards and assessment of control system based on the performance level of the system. In the end are all obtained data evaluated and the precautionary measures are suggested. With taking care of economic factors are finally proposed the possibilities of the elimination of risks.
27
Michel, Pascal. "Etude de machines de turing et complexite algorithmique." Paris 7, 1992. http://www.theses.fr/1992PA077129.
Повний текст джерелаАнотація:
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
28
Renuka, 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.
Повний текст джерела
29
Goutefangea, Patrick. "Alan Turing : La "pensée" des machines et l'idée de pratique." Nantes, 1999. http://www.theses.fr/1999NANT3003.
Повний текст джерелаАнотація:
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-communicationThe 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
30
Atger, Dominique. "A Turing machines simulator using a Microsoft Windows' interface." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865965.
Повний текст джерелаАнотація:
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
31
Wang, 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.
Повний текст джерела
32
Dalle, Vedove Nosaki Gregorio. "Chaos and Turing Machines on Bidimensional Models at Zero Temperature." Thesis, Bordeaux, 2020. http://www.theses.fr/2020BORD0309.
Повний текст джерелаАнотація:
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 HochmanIn 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
33
Van, den Berg Gideon. "Hidden Markov models for tool wear monitoring in turning operations." Diss., Pretoria : [s.n.], 2004. http://upetd.up.ac.za/thesis/available/etd-05302005-114238/.
Повний текст джерела
34
Song, Sukhan. "Intelligent machining control for turning process /." Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.
Повний текст джерела
35
Ulmer, Bernard C. Jr. "Fabrication and calibration of an open architecture diamond turning machine." Thesis, Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/17120.
Повний текст джерела
36
Longo, Eugenio. "AI e IoT: contesto e stato dell’arte." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2022.
Знайти повний текст джерелаАнотація:
L’intelligenza artificiale costituisce un ramo dell’informatica che permette di programmare e progettare sistemi in grado di dotare le macchine di caratteristiche considerate tipicamente umane. L’internet delle cose rappresenta una rete di oggetti fisici in grado di connettersi e scambiare dati con altri dispositivi tramite internet. Nonostante L’internet delle cose e l’intelligenza artificiale rappresentino due concetti diversi, riescono ad integrarsi per creare nuove soluzioni con un elevato potenziale. L’utilizzo combinato di queste due tecnologie permette di aumentare il valore di entrambe le soluzioni, in quanto permette il conseguimento di dati e modelli predittivi. In questo elaborato di tesi l’obiettivo è stato quello di analizzare l’evoluzione dell’intelligenza artificiale e dell’innovazione tecnologica nella vita quotidiana. Nello specifico, l’intelligenza artificiale applicata all’internet delle cose ha preso piede nella gestione di grandi realtà come le smart city o smart mobility o nelle piccole realtà come le smart home, mettendo in rete una grande quantità di dati privati. Tuttavia, esistono ancora delle problematiche. Infatti, ad oggi non è stato ancora raggiunto il livello di sicurezza tale da poter utilizzare queste tecnologie in applicazioni più critiche. La sfida più grande nel mondo del lavoro sarà comprendere e saper sfruttare le potenzialità che il nuovo paradigma nell’utilizzo dell’intelligenza artificiale andrà a suggerire.
37
Atmadi, Alexander. "Cutting fluid aerosol from splash in turning : analysis for environmentally conscious machining." Thesis, Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/19603.
Повний текст джерела
38
Chiou, Yunshun. "Acoustic emission dynamics in turning with tool wear and chatter." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/17990.
Повний текст джерела
39
Knuefermann, Markus M. W. "Machining surfaces of optical quality by hard turning." Thesis, Cranfield University, 2003. http://dspace.lib.cranfield.ac.uk/handle/1826/131.
Повний текст джерелаАнотація:
The main aim of this work was the machining by hard turning of surfaces with optical surface quality. A numerical target had been set as a surface roughness Ra = 10nm. It has been shown that achieving roughness of that magnitude by hard turning is possible. Individual work pieces exhibited the desired surface properties for short lengths at a time, but it proved to be very difficult to achieve these surfaces consistently and over longer cuts. The factors influencing the surface roughness were identified as tool defects and machine vibration in addition to the standard cutting parameters and choice of cutting tool. A model of surface generation in hard turning has been developed and good correlation between simulated and experimentally determined surface roughnesses was achieved. By introducing a material partition equation which determines the proportional contribution of material removal mechanisms in the undeformed chip a comprehensive method for assessing the contributing factors in material removal was developed. While it has been shown that surfaces in hard turning are almost exclusively generated by chip removal and plastic deformation the developed model is versatile enough to include elastic deformation of the work piece. With the help of the model of surface generation in hard turning it has been possible to attribute magnitudes of the influencing factors with respect to the cutting parameters such as feed rate and tool corner radius, and the main disturbances - tool defects and machine vibration. From this conclusions were drawn on the requirements for machine tools and cutting tools, which will need to be realised to make ultra-precision hard turning of surfaces of optical quality a feasible manufacturing process.
40
Medaska, Michael Kenneth. "The measurement of temperatures and forces in a turning operation with cutting fluid." Thesis, Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/15983.
Повний текст джерела
41
Cheng, Hsiang-Nan, and Hsiang-Nan Cheng. "Diamond Turning Properties of Plastic Optical Materials." Thesis, The University of Arizona, 2017. http://hdl.handle.net/10150/625700.
Повний текст джерелаАнотація:
With sub-micrometric form accuracy and nanometer scale surface roughness, the diamond turning process provides a great solution of fast prototyping optical systems with aspheric or freeform surfaces. On the other hand, with relatively lower cost and lighter weight, optical plastics are now widely used in consumer products. To study and optimize the cutting parameters of the diamond turning process on optical plastics, a series of tests with different cutting parameters settings are conducted on seven different optical plastic materials: E48R, OKP1, OKP4, OKP4HT, PC, PMMA, and Rexolite 1422. The relationship between the surface roughness and optical plastic materials is found, and the optimized cutting parameters are recommended.
42
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.
Повний текст джерела
43
Sims, Pauline. "Turing's P-type machine and neural network hybrid systems." Thesis, University of Ulster, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240712.
Повний текст джерела
44
Dawson, Ty Grant. "Effects of cutting parameters and tool wear in hard turning." Thesis, Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/17816.
Повний текст джерела
45
Campbell, Robert David James. "Information processing in microtubules." Thesis, Queensland University of Technology, 2002.
Знайти повний текст джерела
46
Ma, David Chih-Yan. "Design and implementation of a rotary fast tool servo for a turning machine." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/9594.
Повний текст джерелаАнотація:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1998.Includes bibliographical references (p. 149-151).
In this thesis we describe the design and implementation of a rotary fast tool servo (RFTS) in a machine tool for turning ophthalmic lenses. To machine nonrotationally symmetric lenses, the cutting tool on the RFTS must move synchronously with the spindle rotation. Therefore, to cut a lens at high spindle speeds, the cutting tool must be capable of extremely high accelerations. In our design we mount the cutting tool at the end of a rotary arm. This allows us to achieve higher accelerations and lower vibrations than conventional fast tool servos. This thesis describes the development of the RFTS, including component selection and testing. We also detail the design and fabrication of the RFTS that is installed in a prototype turning machine.
by David Chih-Yan Ma.
S.M.
47
Durand, Bruno. "Automates cellulaires : réversibilité et complexité." Lyon 1, 1994. http://www.theses.fr/1994LYO10030.
Повний текст джерелаАнотація:
Nous etudions les automates cellulaires depuis plusieurs points de vue. Nous commencons par les envisager comme des systemes dynamiques et presentons une nouvelle preuve d'un resultat celebre du a richardson: les automates cellulaires sont exactement les fonctions continues qui commutent avec les translations. Cette preuve nous permet d'etudier la minimisation de la representation des automates cellulaires. Ensuite, nous presentons une classification des automates cellulaires en fonction de leur comportement limite, classification que nous prouvons etre partiellement decidable en dimension 1. Nous montrons aussi une extension en termes de probabilites d'un theoreme du a karel culik en 1989. Les methodes utilisees relevent de la topologie et de la combinatoire. La deuxieme partie est plus tournee vers l'algorithmique et la complexite. Nous y presentons deux reductions de problemes de pavages en problemes concernant les automates cellulaires. A l'aide de ces reductions, nous montrons simplement que la surjectivite des automates cellulaires est indecidable en dimension deux (theoreme du a jarkko kari en 1989) ainsi que la co-np-completude et la co-np-completude en moyenne des problemes de decision suivants: - etant donne un automate cellulaire en dimension 2, est-il bijectif quand il est restreint aux configurations finies plus petites que sa taille? - etant donne un automate cellulaire en dimension 2, est-il bijectif quand il est restreint aux configurations periodiques de periode inferieure a sa taille?
48
Bhatt, Dhruv. "Economic Dispatch of the Combined Cycle Power Plant Using Machine Learning." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-266110.
Повний текст джерелаАнотація:
Combined Cycle Power Plant (CCPP)s play a key role in modern powersystem due to their lesser investment cost, lower project executiontime, and higher operational flexibility compared to other conventionalgenerating assets. The nature of generation system is changing withever increasing penetration of the renewable energy resources. Whatwas once a clearly defined generation, transmission, and distributionflow is shifting towards fluctuating distribution generation. Because ofvariation in energy production from the renewable energy resources,CCPP are increasingly required to vary their load levels to keep balancebetween supply and demand within the system. CCPP are facingmore number of start cycles. This induces more stress on the gas turbineand as a result, maintenance intervals are affected.The aim of this master thesis project is to develop a dispatch algorithmfor the short-term operation planning for a combined cyclepower plant which also includes the long-term constraints. The longtermconstraints govern the maintenance interval of the gas turbines.These long-term constraints are defined over number of EquivalentOperating Hours (EOH) and Equivalent Operating Cycles (EOC) forthe Gas Turbine (GT) under consideration. CCPP is operating in theopen electricity market. It consists of two SGT-800 GT and one SST-600 Steam Turbine (ST). The primary goal of this thesis is to maximizethe overall profit of CCPP under consideration. The secondary goal ofthis thesis it to develop the meta models to estimate consumed EOHand EOC during the planning period.Siemens Industrial Turbo-machinery AB (SIT AB) has installed sensorsthat collects the data from the GT. Machine learning techniqueshave been applied to sensor data from the plant to construct Input-Output (I/O) curves to estimate heat input and exhaust heat. Resultsshow potential saving in the fuel consumption for the limit on CumulativeEquivalent Operating Hours (CEOH) and Cumulative EquivalentOperating Cycles (CEOC) for the planning period. However, italso highlighted some crucial areas of improvement before this economicdispatch algorithm can be commercialized.Kombicykelkraftverk spelar en nyckelroll i det moderna elsystemet pågrund av den låga investeringskostnaden, den korta tiden för att byggaett nytta kraftverk och hög flexibilitet jämfört med andra kraftverk.Elproduktionssystemen förändras i takt med en allt större andel förnybarelproduktion. Det som en gång var ett tydligt definierat flödefrån produktion via transmission till distribution ändrar nu karaktärtill fluktuerande, distribuerad generering. På grund av variationernai elproduktion från förnybara energikällor finns ett ökat behov avatt kombicykelkraftverk varierar sin elproduktion för att upprätthållabalansen mellan produktion och konsumtion i systemet. Kombicykelkraftverkbehöver startas och stoppas oftare. Detta medför mer stresspå gasturbinen och som ett resultat påverkas underhållsintervallerna.Syftet med detta examensarbete är att utveckla en algoritm för korttidsplaneringav ett kombicykelkraftverk där även driften på lång siktbeaktas. Begränsningarna på lång sikt utgår från underhållsintervallenför gasturbinerna. Dessa långsiktiga begränsningar definieras som antaletekvivalenta drifttimmar och ekvivalenta driftcykler för det aktuellakraftverket. Kombikraftverket drivs på den öppna elmarknaden.Det består av två SGT-800 GT och en SST-600 ångturbin. Det främstamålet med examensarbetet är att maximera den totala vinsten förkraftverket. Ett sekundärt mål är att utveckla metamodeller för attskatta använda ekvivalenta drifttimmar och ekvivalenta driftcyklerunder planeringsperioden.Siemens Industrial Turbo-machinery AB (SIT AB) har installeratsensorer som samlar in data från gasturbinerna. Maskininlärningsteknikerhar tillämpats på sensordata för att konstruera kurvor för attuppskatta värmetillförseln och avgasvärme. Resultaten visar en potentiellbesparing i bränsleförbrukningen om de sammanlagda ekvivalentadrifttimmarna och de sammanlagda ekvivalenta driftcyklernabegränsas under planeringsperioden. Det framhålls dock också att detfinns viktiga förbättringar som behövs innan korttidsplaneringsalgoritmenkan kommersialiseras.
49
Purarjomandlangrudi, Afrooz. "Application of machine learning technique in wind turbine fault diagnosis." Thesis, Queensland University of Technology, 2014. https://eprints.qut.edu.au/70624/2/Afrooz_Purarjomandlangrudi_Thesis.pdf.
Повний текст джерелаАнотація:
In this study, a machine learning technique called anomaly detection is employed for wind turbine bearing fault detection. Basically, the anomaly detection algorithm is used to recognize the presence of unusual and potentially faulty data in a dataset, which contains two phases: a training phase and a testing phase. Two bearing datasets were used to validate the proposed technique, fault-seeded bearing from a test rig located at Case Western Reserve University to validate the accuracy of the anomaly detection method, and a test to failure data of bearings from the NSF I/UCR Center for Intelligent Maintenance Systems (IMS). The latter data set was used to compare anomaly detection with SVM, a previously well-known applied method, in rapidly finding the incipient faults.
50
Araújo, Anderson. "Uma abordagem modelo-teórica da computabilidade de Turing clássica." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/281062.
Повний текст джерелаАнотація:
Orientador: Walter Alexandre CarnielliTese (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