Program schemes and descriptive complexity
We consider the computational power of classes of program schemes obtained from extending NPS(1) (program schemes of NPS(1) consist of neurodeterministic while programs with quantifier-free tests, which take as input some finite structure over some fixed signature) by: incorporating built-in relatio...
| Main Author: | |
|---|---|
| Published: |
Swansea University
2001
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.636235 |