Sciweavers

3 search results - page 1 / 1
» How much can analog and hybrid systems be proved (super-)Tur...
Sort
View
AMC
2006
131views more  AMC 2006»
13 years 5 months ago
How much can analog and hybrid systems be proved (super-)Turing
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing machines. In a contrapositive way, they say that any model ...
Olivier Bournez
CORR
1999
Springer
115views Education» more  CORR 1999»
13 years 4 months ago
The Symbol Grounding Problem
: There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This pa...
Stevan Harnad
SPIN
2000
Springer
13 years 8 months ago
Verification and Optimization of a PLC Control Schedule
Abstract. We report on the use of model checking techniques for both the verification of a process control program and the derivation of optimal control schedules. Most of this wor...
Ed Brinksma, Angelika Mader