Catálogo de publicaciones - libros
Protein Folding Kinetics: Biophysical Methods
Bengt Nölting
Second Edition.
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
No disponibles.
Disponibilidad
| Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
|---|---|---|---|---|
| No detectada | 2006 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-27277-9
ISBN electrónico
978-3-540-27278-6
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2006
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2006
Cobertura temática
Tabla de contenidos
Highly resolved folding pathways and mechanisms of six proteins
Bengt Nölting
Is randomness in quantum mechanics “algorithmically random”? Is there any relation between Heisenberg’s uncertainty relation and Gödel’s incompleteness? Can quantum randomness be used to trespass the Turing’s barrier? Can complexity shed more light on incompleteness? In this paper we use variants of “algorithmic complexity” to discuss the above questions.
Pp. 165-180
Structural determinants of the rate of protein folding
Bengt Nölting
Is randomness in quantum mechanics “algorithmically random”? Is there any relation between Heisenberg’s uncertainty relation and Gödel’s incompleteness? Can quantum randomness be used to trespass the Turing’s barrier? Can complexity shed more light on incompleteness? In this paper we use variants of “algorithmic complexity” to discuss the above questions.
Pp. 181-185
Evolutionary computer programming of protein structure and folding
Bengt Nölting
Is randomness in quantum mechanics “algorithmically random”? Is there any relation between Heisenberg’s uncertainty relation and Gödel’s incompleteness? Can quantum randomness be used to trespass the Turing’s barrier? Can complexity shed more light on incompleteness? In this paper we use variants of “algorithmic complexity” to discuss the above questions.
Pp. 187-194
Conclusions
Bengt Nölting
Is randomness in quantum mechanics “algorithmically random”? Is there any relation between Heisenberg’s uncertainty relation and Gödel’s incompleteness? Can quantum randomness be used to trespass the Turing’s barrier? Can complexity shed more light on incompleteness? In this paper we use variants of “algorithmic complexity” to discuss the above questions.
Pp. 195-196