Filters
Characterizing the Super-Turing Computer Power and Efficiency of Classical Fuzzy Turing Machines
The first attempts concerning formalization of the notion of fuzzy algorithms in terms of Turing machines are dated in late 1960s when this notion was introduced by Zadeh. Recently, it has been observed that corresponding s...
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Fuzzy Turing Machines Revised.
Fuzzy Turing machines and fuzzy languages were introduced by Zadeh, Lee and Santos in nineteen seventies. Unfortunately, it appears that from computability point of the original model that is based on rigorous math...
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Fuzzy Neuroidal Nets and Recurrent Fuzzy Computations.
We define fuzzy neuroidal nets in a way that enables to relate their computations to computations of fuzzy Turing machines. Namely, we show that the polynomially space-bounded computations of fuzzy Tur...
BA - Obecná matematika
- 2001 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Turing machine in the new media theory
Turing test within new digital media discourse with focus on juxtapositions and potential synthesis of Turing Machine and Big Glass by Marcel Duchamp on platform of Bachelor Machine and posthuman discourse....
AL - Umění, architektura, kulturní dědictví
- 2012 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
Výsledek na webu
The Computational Power of Turing's Non-Terminating Circular a-Machines
A variant of Turing's original a-machines --- the so-called non-terminating circular a-machine --- is shown to be computationally equivalent to a model of unbounded computational processes whose computational power reaches ...
IN - Informatika
- 2013 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Erratum to: entropy of Turing machines with moving head
We prove that the topological entropy of a Turing machine with moving head is zero.
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Evolutionary Synthesis of Rules for Programming the Turing Machine
by Self-Organizing Migrating Algorithm for programming the Turing machine. During for solving concrete tasks by the Turing machine. Thus we prove possibility to employ artificial intelligence at simplifying compli...
IN - Informatika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Turing machine, Test, Body and Apple
The contribution Turing machine, test, body and an apple is dedicated to one of the major themes of cyberculture ? the computer and corporeality. On the example of Turing test we show possible context of enhanced body and m...
AL - Umění, architektura, kulturní dědictví
- 2008 •
- C
Rok uplatnění
C - Kapitola v odborné knize
The Universal Turing Machine on the Dissecting Table
the assumption that Alan M. Turing's concept of the universal machine, the first theoretical description of a computer program (software), is a kind of bachelor machine (Carrouges of the Turing test) as a key to i...
AL - Umění, architektura, kulturní dědictví
- 2013 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
On the Power of Broadcasting in Mobile Computing
is a deterministic Turing machine that can launch new processes among which a wireless of such machines are polynomially time- and space-equivalent to the synchronized alternating Turing machines studied ...
IN - Informatika
- 2008 •
- C
Rok uplatnění
C - Kapitola v odborné knize
- 1 - 10 out of 33 664