Sciweavers

38 search results - page 3 / 8
» On the computing power of fuzzy Turing machines
Sort
View
FORMATS
2006
Springer
13 years 10 months ago
On the Computational Power of Timed Differentiable Petri Nets
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
Serge Haddad, Laura Recalde, Manuel Silva
IGPL
2006
107views more  IGPL 2006»
13 years 6 months ago
Undecidability over Continuous Time
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
Jerzy Mycka, José Félix Costa
TCS
2010
13 years 4 months ago
On the computational power of BlenX
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
Alessandro Romanel, Corrado Priami
BIRTHDAY
2008
Springer
13 years 8 months ago
The Church-Turing Thesis over Arbitrary Domains
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
Udi Boker, Nachum Dershowitz
CJ
2006
100views more  CJ 2006»
13 years 6 months ago
Fuzzifying P Systems
Abstract. Uncertainty is an inherent property of all living systems. Curiously enough, computational models inspired by biological systems do not take, in general, under considerat...
Apostolos Syropoulos