Auswahl der wissenschaftlichen Literatur zum Thema „Machine de turing“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Machine de turing" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Machine de turing"
Daylight, Edgar Graham. „Refining Mark Burgin’s Case against the Church–Turing Thesis“. Philosophies 9, Nr. 4 (12.08.2024): 122. http://dx.doi.org/10.3390/philosophies9040122.
Der volle Inhalt der QuelleVitanyi, Paul. „Turing machine“. Scholarpedia 4, Nr. 3 (2009): 6240. http://dx.doi.org/10.4249/scholarpedia.6240.
Der volle Inhalt der QuelleKurgaev, A. F., und S. N. Grygoryev. „The universal turing machine interpreter“. Reports of the National Academy of Sciences of Ukraine, Nr. 10 (16.11.2016): 28–34. http://dx.doi.org/10.15407/dopovidi2016.10.028.
Der volle Inhalt der QuelleROBINSON, RAPHAEL M. „MINSKY'S SMALL UNIVERSAL TURING MACHINE“. International Journal of Mathematics 02, Nr. 05 (Oktober 1991): 551–62. http://dx.doi.org/10.1142/s0129167x91000302.
Der volle Inhalt der QuelleBeggs, Edwin, José Félix Costa, Bruno Loff und John V. Tucker. „Computational complexity with experiments as oracles“. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464, Nr. 2098 (24.06.2008): 2777–801. http://dx.doi.org/10.1098/rspa.2008.0085.
Der volle Inhalt der QuelleThiagarajan, P. S. „The Turing machine“. Resonance 2, Nr. 7 (Juli 1997): 3–4. http://dx.doi.org/10.1007/bf02838584.
Der volle Inhalt der QuelleITO, AKIRA, KATSUSHI INOUE, ITSUO TAKANAMI und YUE WANG. „THE EFFECT OF INKDOTS FOR TWO-DIMENSIONAL AUTOMATA“. International Journal of Pattern Recognition and Artificial Intelligence 09, Nr. 05 (Oktober 1995): 777–96. http://dx.doi.org/10.1142/s0218001495000328.
Der volle Inhalt der QuelleCALUDE, CRISTIAN S., und LUDWIG STAIGER. „A note on accelerated Turing machines“. Mathematical Structures in Computer Science 20, Nr. 6 (08.11.2010): 1011–17. http://dx.doi.org/10.1017/s0960129510000344.
Der volle Inhalt der QuelleMacura, Wiktor K. „n-Skip Turing Machines“. Complex Systems 15, Nr. 3 (15.09.2005): 237–44. http://dx.doi.org/10.25088/complexsystems.15.3.237.
Der volle Inhalt der QuelleDe Brito, Vasco Boavida, José Félix Costa und Diogo Poças. „The Power of Machines That Control Experiments“. International Journal of Foundations of Computer Science 33, Nr. 02 (Februar 2022): 91–118. http://dx.doi.org/10.1142/s0129054122500010.
Der volle Inhalt der QuelleDissertationen zum Thema "Machine de turing"
Chen, Yin Fu. „SIMTM turing machine simulator“. CSUSB ScholarWorks, 1995. https://scholarworks.lib.csusb.edu/etd-project/1229.
Der volle Inhalt der QuelleToister, Yanai. „Photography from the Turin Shroud to the Turing Machine“. Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14911.
Der volle Inhalt der QuelleCapuni, Ilir. „A fault-tolerant Turing machine“. Thesis, Boston University, 2013. https://hdl.handle.net/2144/13608.
Der volle Inhalt der QuelleThe 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.
Masum, Hassan Carleton University Dissertation Mathematics. „An exploration of turing machine based complexity“. Ottawa, 1995.
Den vollen Inhalt der Quelle findenMüller, Markus. „Quantum Kolmogorov complexity and the quantum turing machine“. [S.l.] : [s.n.], 2007. http://opus.kobv.de/tuberlin/volltexte/2007/1655.
Der volle Inhalt der QuelleKalyanasundaram, Subrahmanyam. „Turing machine algorithms and studies in quasi-randomness“. Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42808.
Der volle Inhalt der QuelleRendell, P. „Turing machine universality of the game of life“. Thesis, University of the West of England, Bristol, 2014. http://eprints.uwe.ac.uk/22323/.
Der volle Inhalt der QuelleShah, Huma. „Deception-detection and machine intelligence in practical Turing tests“. Thesis, University of Reading, 2010. http://centaur.reading.ac.uk/24768/.
Der volle Inhalt der QuelleTantau, 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.
Der volle Inhalt der QuelleGirardot, 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.
Der volle Inhalt der QuelleThis 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
Bücher zum Thema "Machine de turing"
Arnold, Schönhage. Fast algorithms: A multitape Turing machine implementation. Mannheim: B.I. Wissenschaftsverlag, 1994.
Den vollen Inhalt der Quelle findenRolf, Herken, Hrsg. The Universal Turing machine: A half-centurysurvey. Oxford: Oxford University Press, 1988.
Den vollen Inhalt der Quelle findenRolf, Herken, Hrsg. The Universal Turing machine: A half-century survey. Oxford: Oxford University Press, 1988.
Den vollen Inhalt der Quelle findenRolf, Herken, Hrsg. The universal turing machine: A half-century survey. Oxford: Oxford University Press, 1988.
Den vollen Inhalt der Quelle findenRendell, Paul. Turing Machine Universality of the Game of Life. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-19842-2.
Der volle Inhalt der QuelleHerken, Rolf, Hrsg. The Universal Turing Machine A Half-Century Survey. Vienna: Springer Vienna, 1995. http://dx.doi.org/10.1007/978-3-7091-6597-3.
Der volle Inhalt der QuelleHerken, Rolf. The Universal Turing Machine A Half-Century Survey. Vienna: Springer Vienna, 1995.
Den vollen Inhalt der Quelle findenRolf, Herken, Hrsg. The universal Turing machine: A half-century survey. 2. Aufl. Wien: Springer-Verlag, 1995.
Den vollen Inhalt der Quelle findenRolf, Herken, Hrsg. The universal Turing machine: A half-century survey. Wien: Springer-Verlag, 1994.
Den vollen Inhalt der Quelle findenDuPuis, Christopher. An animated Turning [sic] machine simulator in Forms/3. Corvallis, OR: Oregon State University, Dept. of Computer Science, 1997.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Machine de turing"
Maruoka, Akira. „Turing Machine“. In Concise Guide to Computation Theory, 133–59. London: Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-535-4_6.
Der volle Inhalt der QuelleWeik, Martin H. „Turing machine“. In Computer Science and Communications Dictionary, 1844. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_20210.
Der volle Inhalt der QuelleKurgalin, Sergei, und Sergei Borzunov. „Turing Machine“. In Texts in Computer Science, 339–50. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-92645-2_10.
Der volle Inhalt der QuelleKurgalin, Sergei, und Sergei Borzunov. „Turing Machine“. In Texts in Computer Science, 343–55. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-42221-9_10.
Der volle Inhalt der QuelleRobič, Borut. „The Turing Machine“. In The Foundations of Computability Theory, 101–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-44808-3_6.
Der volle Inhalt der QuelleRobič, Borut. „The Turing Machine“. In The Foundations of Computability Theory, 111–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2020. http://dx.doi.org/10.1007/978-3-662-62421-0_6.
Der volle Inhalt der QuelleWeik, Martin H. „universal Turing machine“. In Computer Science and Communications Dictionary, 1865. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_20474.
Der volle Inhalt der QuelleMorazán, Marco T. „Turing Machine Composition“. In Texts in Computer Science, 397–431. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43973-5_16.
Der volle Inhalt der QuelleMorazán, Marco T. „Turing Machine Extensions“. In Texts in Computer Science, 433–65. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43973-5_17.
Der volle Inhalt der QuelleJohnson, Michael L. „Turing, More, Analogies“. In Mind, Language, Machine, 73–79. London: Palgrave Macmillan UK, 1988. http://dx.doi.org/10.1007/978-1-349-19404-9_14.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Machine de turing"
Azogagh, Sofiane, Victor Delfour und Marc-Olivier Killijian. „Oblivious Turing Machine“. In 2024 19th European Dependable Computing Conference (EDCC). IEEE, 2024. http://dx.doi.org/10.1109/edcc61798.2024.00017.
Der volle Inhalt der QuelleGrosz, Barbara, Edward A. Feigenbaum, Marvin Minsky, Judea Pearl und Raj Reddy. „Human and Machine Intelligence“. In ACM Turing Centenary Celebration. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2322176.2322180.
Der volle Inhalt der QuelleMallik, Abhishek, und Anavi Khetarpal. „Turing Machine based Syllable Splitter“. In 2021 Fourth International Conference on Computational Intelligence and Communication Technologies (CCICT). IEEE, 2021. http://dx.doi.org/10.1109/ccict53244.2021.00028.
Der volle Inhalt der QuelleLuo, Yue, und Jia-li Feng. „Turing Machine on Attribute Theory“. In 2010 IEEE International Conference on Granular Computing (GrC-2010). IEEE, 2010. http://dx.doi.org/10.1109/grc.2010.9.
Der volle Inhalt der QuelleChristy, D. K. Sheena, A. John Kaspar und D. G. Thomas. „On reversible fuzzy turing machine“. In 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0109238.
Der volle Inhalt der QuelleJordan, Michael I. „Machine learning“. In TURC 2018: ACM Turing Celebration Conference - China. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3210713.3210718.
Der volle Inhalt der QuelleKundra, Rohan, Harshul Singhal und Nitin Nitin. „Turing Machine for i-Head Hydra“. In 2010 12th International Conference on Computer Modelling and Simulation. IEEE, 2010. http://dx.doi.org/10.1109/uksim.2010.11.
Der volle Inhalt der QuelleTorres-Aviles, Rodrigo. „Reversibility in Turing machine topological models“. In 2022 41st International Conference of the Chilean Computer Science Society (SCCC). IEEE, 2022. http://dx.doi.org/10.1109/sccc57464.2022.10000314.
Der volle Inhalt der QuelleLi, Wanwan. „Simulating Turing Machine in Augmented Reality“. In 2022 International Conference on Computational Science and Computational Intelligence (CSCI). IEEE, 2022. http://dx.doi.org/10.1109/csci58124.2022.00362.
Der volle Inhalt der QuelleZhou, Xiangbing, und Wenquan Wu. „SOA Services Modeling Based on Turing Machine“. In 2008 Second International Symposium on Intelligent Information Technology Application (IITA). IEEE, 2008. http://dx.doi.org/10.1109/iita.2008.356.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Machine de turing"
Garrard, K. P., L. W. Taylor, B. F. Knight und R. J. Fornaro. Diamond turning machine controller implementation. Office of Scientific and Technical Information (OSTI), Dezember 1988. http://dx.doi.org/10.2172/476633.
Der volle Inhalt der QuelleEstler, W. Tyler, und Edward B. Magrab. Validation metrology of the large optics diamond turning machine. Gaithersburg, MD: National Bureau of Standards, Januar 1985. http://dx.doi.org/10.6028/nbs.ir.85-3182.
Der volle Inhalt der QuelleHayes, S. Displacement driven balancing of a diamond turning machine flycutter. Office of Scientific and Technical Information (OSTI), Juli 2021. http://dx.doi.org/10.2172/1810662.
Der volle Inhalt der QuelleBaird, E. D., R. R. Donaldson und S. R. Patterson. The laser interferometer system for the large optics diamond turning machine. Office of Scientific and Technical Information (OSTI), Juni 1999. http://dx.doi.org/10.2172/9646.
Der volle Inhalt der QuelleParedes, Juan Roberto, María Clara Ramos, Marina Robles und Emma Näslund-Hadley. Energy Savings, Efficient Use, and Alternative Technologies. Inter-American Development Bank, April 2015. http://dx.doi.org/10.18235/0006241.
Der volle Inhalt der QuelleSiantar, M. Seismic Bracing Development for the Moore 3 Diamond Turning Machine at Lawrence Livermore National Laboratory. Office of Scientific and Technical Information (OSTI), Mai 2024. http://dx.doi.org/10.2172/2370174.
Der volle Inhalt der QuelleLewin, Alex, Karla Diaz-Ordaz, Chris Bonell, James Hargreaves und Edoardo Masset. Machine learning for impact evaluation in CEDIL-funded studies: an ex ante lesson learning paper. Centre for Excellence and Development Impact and Learning (CEDIL), April 2023. http://dx.doi.org/10.51744/llp3.
Der volle Inhalt der QuelleHoffman, Wyatt. AI and the Future of Cyber Competition. Center for Security and Emerging Technology, Januar 2021. http://dx.doi.org/10.51593/2020ca007.
Der volle Inhalt der QuelleAlonso-Robisco, Andrés, José Manuel Carbó und José Manuel Carbó. Machine Learning methods in climate finance: a systematic review. Madrid: Banco de España, Februar 2023. http://dx.doi.org/10.53479/29594.
Der volle Inhalt der QuelleBooth, Steven Richard, Timothy Grant Dinehart und Faith Ann Benson. Business Case Analysis for Replacing the Mazak 30Y Mill-Turn Machine in SM-39. Summary. Office of Scientific and Technical Information (OSTI), März 2015. http://dx.doi.org/10.2172/1171676.
Der volle Inhalt der Quelle