Computational complexity in non-Turing models of computation: The what, the why and the how
<p>We preliminarily recap what is meant by <em>complexity</em> and <em>non-Turing computation</em>, by way of explanation of our title, 'Computational Complexity in Non-Turing Models of Computation'.</p><p> Based on investigation of a motivating ex...
| প্রধান লেখক: | |
|---|---|
| বিন্যাস: | Journal article |
| ভাষা: | English |
| প্রকাশিত: |
Elsevier
2011
|
| বিষয়গুলি: |