Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 113 for “"Turing"”.
-
Computable Linear Orders and Turing Reductions
… thesis explores computable linear orders through Turing Reductions and codes zero jump and zero double jump into linear orders using discrete, dense, and block linear relations.</p>
-
Turing machines, computers and artificial intelligence
… 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 …
-
Duchamp Meets Turing: Art, Modernism, Posthuman
… with those of cybernetics, to bring together ‘Turing land’ and ‘Duchamp land’ (Manovich 1996). For achieving this, digitalisation processes are not to be understood as representations of some material reality, but rather as ontological repetitions through which difference is conveyed. This is …
-
Alternation and Omega-Type Turing Acceptors
… the classes of (omega)-languages accepted by Turing Acceptors when infinite computations are allowed. There are various possible "natural" acceptance conditions to consider, including those already common in the literature of (omega)-automata. There are also the deterministic (D), …
-
A Turing Game for commonsense knowledge extraction
… other similar knowledge acquisition systems, our Turing Game performs better with respect to coverage/redundancy and reliability of the commonsense acquired.
-
Turing Decidability and Computational Complexity of MorseHomology
… data is computable in the classical sense of Turing decidability, bound the complexity of finding the Morse homology of a given simplicial complex, and provide a measure for when this is more efficient than simplicial homology.
-
Turing-Completeness as Medium: Art, Computers and Intentionality
… outside art practice, chiefly among them Alan Turing’s definition of a "a(utomatic)-machine", (nowadays called a “Turing machine”) from his 1936 paper "On Computable Numbers, with an Application to the Entscheidungsproblem". Turing described a machine which can “simulate” any other computing …
-
Samkennd og samskipti: Turing-prófið í ljósi tungumálagreiningar Maurice Merleau-Ponty
Rúmum sjö áratugum eftir að Alan Turing gaf út ritgerð sína „Computing Machinery and Intelligence“ sem lýsti svokölluðu Turing-prófi til þess að athuga hvort vél hugsi eða ekki, þá hefur engin tölva enn staðist prófið. Það virðist samt, á tímum þar sem misgóð spjallvélmenni taka á móti manni á …
-
Towards Passing Visual Turing Test with Computational 3D Displays and Appearance Modeling
… Facebook) defined a grand challenge termed visual Turing test in 2022, asking if the virtual experience can be created as vivid and realistic as the real-world such that a human observer can no longer distinguish. Passing this test requires significant technological advancements in areas such as …
-
A relatively small turing machine whose behavior is independent of set theory
… 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 …
-
On a Reducibility Concept Among Sets of Infinite Strings Induced by Turing Machine Transducers
Made available in DSpace on 2014-12-11T18:24:11Z (GMT). No. of bitstreams: 1 7500301.pdf: 1963619 bytes, checksum: cf36fe9cedab4965903d68950b525d13 (MD5) Previous issue date: 1974
-
Instabilidade de Turing em modelos de EDP reação-difusão com termos não locais e aplicações
… numericamente o efeito da instabilidade de Turing nesses modelos. Através de um modelo epidemiológico compartimental do tipo SIR, estudamos o pa- pel dos não - infecciosos na evolução da virulência de um patógeno. Os resultados mostraram que a introdução do processo difusivo influencia …
-
Extended cognition, dynamics, and algorithms. A turing machine based approach to the study of arithmetical skills
… 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 …
-
Interfaces between Competing Patterns in Reaction-diffusion Systems with Nonlocal Coupling
… while, for fast inhibitor diffusion, a Turing instability is found. For moderate values of the inhibitor diffusion these two instabilities occur simultaneously at a codimension-2 wave-Turing instability. We perform a weakly nonlinear analysis of the model in the neighbourhood of this …
-
Analysis of pattern dynamics for a nonlinear model of the human cortex via bifurcation theories
… inhibitory diffusion D₂ (identified as the Turing bifurcation parameter) and the time-to-peak for hyperpolarising GABA response γi (i.e., inhibitory rate-constant, identified as the Hopf bifurcation parameter). The cortical model simplifies the entire cortex to a cylindrical macrocolumn (∼ 1 …
-
Population Dynamics and Pattern Formation in an Info-chemical Mediated Tri-trophic Plankton Model
… In relation to this, the critical conditions for Turing instability are derived; these are necessary and sufficient. Furthermore, we consider the degenerated situation wherein Turing bifurcation and Hopf bifurcation occur simultaneously. We also consider under what conditions Turing patterns are …
-
The power of parallel time
… wide range of machine models, including the tree Turing machine, the multidimensional Turing machine, the log-cost RAM (random access machine), the unit-cost RAM, and the pointer machine. All previous speedup results either relied on the severe limitation on the storage structure of ${\cal M}$ …
-
Modeling Optimal Information Acquisition Time Driven by Event Importance for Decision Making: Integrating Gödel's Incompleteness, Turing's Computability, and Simon's Bounded Rationality
… του Gödel, τη Θεωρία Υπολογισιμότητας του Turing και την Περιορισμένη Ορθολογικότητα του Herbert Simon, η έρευνα αυτή προτείνει ένα νέο μοντέλο για την κατανόηση της δυναμικής της απόκτησης πληροφορίας σε σχέση με τη λήψη αποφάσεων που καθοδηγείται από γεγονότα. Η Μη Πληρότητα του Gödel …
Page 1 of 6