Abstract
In contrast to most kinds of computability studied in mathematical logic, feedback computability has a non-degenerate notion of parallelism. Here we study parallelism for the most basic kind of feedback, namely that of Turing computability.We investigate several different possible definitions of parallelism in this context, with an eye toward specifying what is so computable. For the deterministic notions of parallelism identified we are successful in this analysis; for the non-deterministic notion, not completely.
Author supplied keywords
Cite
CITATION STYLE
Lubarsky, R. S. (2016). Parallel feedback turing computability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9537, pp. 236–250). Springer Verlag. https://doi.org/10.1007/978-3-319-27683-0_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
