Gordana Dodig Crnkovic · 2011
New research results from computer science, physics, logics, cognitive science, bioinformatics and related research fields provide strong reasons for us to try to generalize the idea of computing. Generalization of Turing concept of computation in essentially two ways: 1. Generalization of the model, extending the idea of algorithm to a non-halting non halting process (Wegner, Burgin, Rice). 2. Generalization of the physical realization of computation process (MacLennan, Lloyd, Cooper, Hogarth).
Cited by 0
Vitányi, Paul · Data Archiving and Networked Services (DANS) · 2009
Cited by 0Open access
Pallavi Vijay Chavan, Ashish Jadhav · Elsevier eBooks · 2023
Cited by 0
P.M.B. (Paul) Vitányi · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 2009
Cited by 0Open access
Paul Vitányi · Scholarpedia · 2009
Cited by 2Open access
Murzi, Mauro · Riviste UNIMI (Università degli studi di Milano) · 2008
Cited by 0
2023
The Turing machine is a powerful theoretical concept that has been used to prove fundamental results in computer science and mathematics. The interchangeability of program and behavior is a fundamental concept in the field of computer science, particularly in the study of Turing machines and other computational models. Computability theory, also known as recursion theory, is a branch of theoretical computer science and mathematical logic that studies the concept of computability. Automata theory is a branch of computer science that studies the properties of abstract computing devices called automata. The concept of Turing machines raises several philosophical issues, including the nature of computation, the limits of knowledge, and the relationship between mind and machine. Recursive functions, also known as computable functions, are a class of functions that can be calculated by an algorithm. Turing machine is a fundamental concept in intelligent control and artificial intelligence.
Cited by 0
Stjepan Pekić · Repository of FERIT Osijek · 2024
Britanski znanstvenik Alan Turing je 1936. godine opisao mehanički uređaj koji bi imao sve sposobnosti kao i moderno računalo, koji je po njemu i nazvan Turingov stroj. Turingov stroj vrlo je koristan kao ideja u misaonim eksperimentima, odnosno kao princip njegova rada Turingov stroj sastoji se od "glave" uređaja i "beskonačne" vrpce sa koje glava čita i na koju zapisuje simbole. "Glava" uređaja čita simbol sa vrpce, zatim na temelju tog simbola i unutrašnjeg stanja zapisuje određeni simbol na to mjesto te se zatim pomiče za najviše jedno mjesto desno ili lijevo po vrpci. Kada stroj odradi posao zaustavlja se i ostaje u stanju mirovanja. Cilj ovog rada bio je ostvariti binarni kalkulator za zbrajanje, oduzimanje, množenje i dijeljenje primjenom načela rada Turingovog stroja. Osim pružanja koda za funkcionalan binarni kalkulator, rad sadrži i temeljito objašnjenje načina na koji funkcionira Turingov stroj, što je prikazano kroz konkretan primjer rada kalkulatora oponašajući Turingov stroj.
Cited by 0Open access
2004
Cited by 0
TUOMOLA, MIKA JOUKO ALEKSI, Pesonen, J., Saarinen, L. et al. · Virtual Community of Pathological Anatomy (University of Castilla La Mancha) · 2014
The Turing Machine Cross media concept is based on the life of Alan Turing (1912-1954), who was a wartime code-breaker and pioneer of computer science – often considered the father of modern computing. He made a significant and provocative contribution to the debate regarding artificial intelligence: whether it will ever be possible to say that a machine is conscious and can think. Alan01 installation (which Tuomola has co-dramatised) & Turing Machine multimedia opera (in which he co-produced the 3D set) are still touring the world (2013-2014), as one can read it the news items in the end of the transmedia production desciptuion).
Cited by 0
Vitányi, P.M.B. (Paul) · CWI's Institutional Repository (Centrum Wiskunde & Informatica) · 2009
Cited by 0Open access
Andrew Hodges · 1990
Abstract By marking its fiftieth anniversary, this volume recognizes the long-lasting influence of the Turing machine concept. By collecting together new contributions from so many fields, it signals the exceptionally wide scope of that influence. This brief essay, intended to recall and honor the person of Alan M. Turing himself, will likewise mark not only the historical moment of Turing’s publication, but will seek to convey the breadth of thought that underlay his introduction and development of the machine concept. Alan Turing was born on 23 June 1912, and after submitting to a traditional British upper-middle-class schooling, won a scholarship to King’s College, Cambridge University. He graduated with distinction in mathematics in 1934. Within less than a year he was elected to a Fellowship of King’s College, his dissertation being a proof of the Central Limit Theorem, and it might have appeared that his interests would focus on the theory of probability.
Cited by 3
Andrew Hodges · Computerkultur · 1995
Cited by 12
Dw Davies · 2012
Signed algorithms and scatter/gather I/O have garnered tremendous interest from both system administrators and biologists in the lastseveralyears. Afteryearsofconfirmedresearch into the producer-consumer problem, we demonstrate the refinement of IPv4. In this work, we concentrate our efforts on proving that online algorithms and XML can interfere to accomplish this aim. 1
Cited by 0
Ben Abdallah, Hamdi · SPIRE - Sciences Po Institutional REpository · 2009
National audience
Cited by 0
Jan Vacek · Digital Repository (National Repository of Grey Literature) · 2010
Cited by 0
Viktor Bahýľ · Digital Repository (National Repository of Grey Literature) · 2019
Title: Universal Turing machine Author: Viktor Bahýľ Department: Department of Algebra Supervisor: RNDr. Jan Krajíček, DrSc., Department of Algebra Abstract: This thesis is focused on the processes of solving computational problems. The Turing machine is an example of a model which we can use to solve these problems and these machines are the main objective of this Bachelor thesis. The generality of the model is important; it allows us to simulate any conceivable algorithm. In the theory of Turing machines, the generality is demonstrated by the construction of a universal Turing machine. This is the task of this Thesis: to define a universal Turing machine and to prove its universality. Key definitions, linked with the Turing machines, are recalled at the beginning of the Thesis. The simulation and representation of Turing machines will prove to be the key concepts. We make an extra effort to explain these fundamental notions. The thesis has its own form of representation and defined Turing machine with detailed descriptions for them, together with complete proof of the universality of the mentioned Turing machine. Keywords: Turing, machine, universality, representation
Cited by 0
Intelligence Service Schriften · PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO. eBooks · 1998
In recent years, much research has been devoted totheexplorationofIPv4; nevertheless, fewhave explored the evaluation of thin clients. Given the current status of virtual technology, cyberinformaticians famously desire the construction ofMarkov models. Inthisworkweusedecentralized algorithms to validate that the seminal introspectivealgorithmfortheessentialunification oflocal-area networksandextremeprogramming by Kenneth Iverson et al. runs in Ω(n 2) time. It might seem perverse but fell in line with our expectations. 1
Cited by 5
Wolfram Demonstrations Project · 2008
A Turing machine is a minimal idealization of a computer It consists of a line of cells known as the tape with an active element called the head that moves back and forth on the tape and changes the color of cells according to a set of rules For various initial conditions axis the plot shows the number of times the head changes direction in the first 50 steps of the evolution of the Turing machin
Cited by 0Open access
Wolfram Demonstrations Project · 2007
A Turing machine with possible head states and possible tape colors faces possible situations Assuming the head can move in different locations where is most often 2 a Turing machine can produce outputs There are thus possible Turing machines of this sort This Demonstration shows the enumeration scheme used by Mathematica for describing onedimensional Turing machines The top portion of each of the
Cited by 0Open access