Implications of the Turing completeness of reaction-diffusion models, informed by GPGPU simulations on an XBox 360: cardiac arrhythmias, re-entry and the Halting problem. Export

@article{citeulike:5183582, abstract = {In the arsenal of tools that a computational modeller can bring to bare on the study of cardiac arrhythmias, the most widely used and arguably the most successful is that of an excitable medium, a special case of a reaction-diffusion model. These are used to simulate the internal chemical reactions of a cardiac cell and the diffusion of their membrane voltages. Via a number of different methodologies it has previously been shown that reaction-diffusion systems are at multiple levels Turing complete. That is, they are capable of computation in the same manner as a universal Turing machine. However, all such computational systems are subject to a limitation known as the Halting problem. By constructing a universal logic gate using a cardiac cell model, we highlight how the Halting problem therefore could limit what it is possible to predict about cardiac tissue, arrhythmias and re-entry. All simulations for this work were carried out on the GPU of an XBox 360 development console, and we also highlight the great gains in computational power and efficiency produced by such general purpose processing on a GPU for cardiac simulations.}, author = {Scarle, Simon}, citeulike-article-id = {5183582}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.compbiolchem.2009.05.001}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S1476927109000486}, citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/19577519}, citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=19577519}, citeulike-linkout-4 = {http://www2.warwick.ac.uk/newsandevents/pressreleases/researchers_using_parallel/}, day = {11}, doi = {10.1016/j.compbiolchem.2009.05.001}, issn = {1476-928X}, journal = {Computational biology and chemistry}, keywords = {gpu-processing, parallel-computing}, month = {August}, number = {4}, pages = {253--260}, posted-at = {2009-09-21 09:00:07}, priority = {2}, title = {Implications of the Turing completeness of reaction-diffusion models, informed by GPGPU simulations on an XBox 360: cardiac arrhythmias, re-entry and the Halting problem.}, url = {http://dx.doi.org/10.1016/j.compbiolchem.2009.05.001}, volume = {33}, year = {2009} }

TY - JOUR ID - citeulike:5183582 L3 - citeulike-article-id:5183582 N2 - In the arsenal of tools that a computational modeller can bring to bare on the study of cardiac arrhythmias, the most widely used and arguably the most successful is that of an excitable medium, a special case of a reaction-diffusion model. These are used to simulate the internal chemical reactions of a cardiac cell and the diffusion of their membrane voltages. Via a number of different methodologies it has previously been shown that reaction-diffusion systems are at multiple levels Turing complete. That is, they are capable of computation in the same manner as a universal Turing machine. However, all such computational systems are subject to a limitation known as the Halting problem. By constructing a universal logic gate using a cardiac cell model, we highlight how the Halting problem therefore could limit what it is possible to predict about cardiac tissue, arrhythmias and re-entry. All simulations for this work were carried out on the GPU of an XBox 360 development console, and we also highlight the great gains in computational power and efficiency produced by such general purpose processing on a GPU for cardiac simulations. IS - 4 JF - Computational biology and chemistry SN - 1476-928X EP - 260 TI - Implications of the Turing completeness of reaction-diffusion models, informed by GPGPU simulations on an XBox 360: cardiac arrhythmias, re-entry and the Halting problem. VL - 33 SP - 253 KW - gpu-processing KW - parallel-computing AU - Scarle, Simon PY - 2009/08/11/ UR - http://dx.doi.org/10.1016/j.compbiolchem.2009.05.001 ER -