Добірка наукової літератури з теми "Computational complexity and computability"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Computational complexity and computability".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Computational complexity and computability"
Dean, Walter. "Computational Complexity Theory and the Philosophy of Mathematics†." Philosophia Mathematica 27, no. 3 (October 1, 2019): 381–439. http://dx.doi.org/10.1093/philmat/nkz021.
Повний текст джерелаJaparidze, Giorgi. "Arithmetics based on computability logic." Logical Investigations 25, no. 2 (December 23, 2019): 61–74. http://dx.doi.org/10.21146/2074-1472-2019-25-2-61-74.
Повний текст джерелаReif, J. H., J. D. Tygar, and A. Yoshida. "Computability and complexity of ray tracing." Discrete & Computational Geometry 11, no. 3 (March 1994): 265–88. http://dx.doi.org/10.1007/bf02574009.
Повний текст джерелаYampolsky, Michael. "Towards understanding the theoretical challenges of numerical modeling of dynamical systems." New Zealand Journal of Mathematics 52 (September 19, 2021): 453–67. http://dx.doi.org/10.53733/129.
Повний текст джерелаBEGGS, EDWIN, JOSÉ FÉLIX COSTA, and JOHN V. TUCKER. "THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY." Review of Symbolic Logic 7, no. 4 (September 9, 2014): 618–46. http://dx.doi.org/10.1017/s1755020314000240.
Повний текст джерелаBlum, Manuel, and Santosh Vempala. "The complexity of human computation via a concrete model with an application to passwords." Proceedings of the National Academy of Sciences 117, no. 17 (April 14, 2020): 9208–15. http://dx.doi.org/10.1073/pnas.1801839117.
Повний текст джерелаValenti, Manlio. "A journey through computability, topology and analysis." Bulletin of Symbolic Logic 28, no. 2 (June 2022): 266–67. http://dx.doi.org/10.1017/bsl.2022.13.
Повний текст джерелаMiguel-Tomé, Sergio, Ángel L. Sánchez-Lázaro, and Luis Alonso-Romero. "Fundamental Physics and Computation: The Computer-Theoretic Framework." Universe 8, no. 1 (January 11, 2022): 40. http://dx.doi.org/10.3390/universe8010040.
Повний текст джерелаBARAKAT, MOHAMED, and MARKUS LANGE-HEGERMANN. "AN AXIOMATIC SETUP FOR ALGORITHMIC HOMOLOGICAL ALGEBRA AND AN ALTERNATIVE APPROACH TO LOCALIZATION." Journal of Algebra and Its Applications 10, no. 02 (April 2011): 269–93. http://dx.doi.org/10.1142/s0219498811004562.
Повний текст джерелаIgusa, Gregory. "Nonexistence of minimal pairs for generic computability." Journal of Symbolic Logic 78, no. 2 (June 2013): 511–22. http://dx.doi.org/10.2178/jsl.7802090.
Повний текст джерелаДисертації з теми "Computational complexity and computability"
Latsch, Wolfram Wilhelm. "Beyond complexity and evolution : on the limits of computability in economics." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325103.
Повний текст джерелаPouly, Amaury. "Continuous models of computation: from computability to complexity." Palaiseau, Ecole polytechnique, 2015. https://theses.hal.science/tel-01223284/document.
Повний текст джерелаPégny, Maël. "Sur les limites empiriques du calcul : calculabilité, complexité et physique." Thesis, Paris 1, 2013. http://www.theses.fr/2013PA010673/document.
Повний текст джерелаRecent years have seen a surge in the interest for non-standard computational models, inspired by physical, biological or chemical phenomena. The exact properties of some of these models have been a topic of somewhat heated discussion: what do they compute? And how fast do they compute? The stakes of these questions were heightened by the claim that these models would violate the accepted limits of computation, by violating the Church-Turing Thesis or the Extended Church-Turing Thesis. To answer these questions, the physical realizability of some of those models - or lack thereof - has often been put at the center of the argument. It thus seems that empirical considerations have been introduced into the very foundations of computability and computational complexity theory, both subjects that would have been previously considered purely a priori parts of logic and computer science. Consequently, this dissertation is dedicated to the following question: do computability and computational complexity theory rest on empirical foundations? If yes, what are these foundations? We will first examine the precise meaning of those limits of computation, and articulate a philosophical conception of computation able to make sense of this variety of models. We then answer the first question by the affirmative, through a careful examination of current debates around non-standard models. We show the various difficulties surrounding the second question, and study how they stem from the complex translation of computational concepts into physical limitations
Kübel, David J. F. [Verfasser]. "On some Geometric Search Problems : Algorithms, Complexity, Computability / David J. F. Kübel." Bonn : Universitäts- und Landesbibliothek Bonn, 2020. http://d-nb.info/1224270606/34.
Повний текст джерелаFarr, Graham E. "Topics in computational complexity." Thesis, University of Oxford, 1986. http://ora.ox.ac.uk/objects/uuid:ad3ed1a4-fea4-4b46-8e7a-a0c6a3451325.
Повний текст джерелаVikas, Narayan. "Computational complexity of graph compaction." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq24360.pdf.
Повний текст джерелаYamakami, Tomoyuki. "Average case computational complexity theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq28091.pdf.
Повний текст джерелаTseng, Hung-Li. "Computational Complexity of Hopfield Networks." Thesis, University of North Texas, 1998. https://digital.library.unt.edu/ark:/67531/metadc278272/.
Повний текст джерелаRubiano, Thomas. "Implicit Computational Complexity and Compilers." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCD076/document.
Повний текст джерелаLa théorie de la complexité´e s’intéresse à la gestion des ressources, temps ou espace, consommés par un programmel ors de son exécution. L’analyse statique nous permet de rechercher certains critères syntaxiques afin de catégoriser des familles de programmes. L’une des approches les plus fructueuses dans le domaine consiste à observer le comportement potentiel des données manipulées. Par exemple, la détection de programmes “non size increasing” se base sur le principe très simple de compter le nombre d’allocations et de dé-allocations de mémoire, en particulier au cours de boucles et on arrive ainsi à détecter les programmes calculant en espace constant. Cette méthode s’exprime très bien comme propriété sur les graphes de flot de contrôle. Comme les méthodes de complexité implicite fonctionnent à l’aide de critères purement syntaxiques, ces analyses peuvent être faites au moment de la compilation. Parce qu’elles ne sont ici que statiques, ces analyses ne sont pas toujours calculables ou facilement calculables, des compromis doivent être faits en s’autorisant des approximations. Dans le sillon du “Size-Change Principle” de C. S. Lee, N. D. Jones et A. M. Ben-Amram, beaucoup de recherches reprennent cette méthode de prédiction de terminaison par observation de l’évolution des ressources. Pour le moment, ces méthodes venant des théories de la complexité implicite ont surtout été appliquées sur des langages plus ou moins jouets. Cette thèse tend à porter ces méthodes sur de “vrais” langages de programmation en s’appliquant au niveau des représentations intermédiaires dans des compilateurs largement utilises. Elle fournit à la communauté un outil permettant de traiter une grande quantité d’exemples et d’avoir une idée plus précise de l’expressivité réelle de ces analyses. De plus cette thèse crée un pont entre deux communautés, celle de la complexité implicite et celle de la compilation, montrant ainsi que chacune peut apporter à l’autre
Okabe, Yasuo. "Parallel Computational Complexity and Date-Transfer Complexity of Supercomputing." Kyoto University, 1994. http://hdl.handle.net/2433/74658.
Повний текст джерелаКниги з теми "Computational complexity and computability"
Börger, E. Computability, complexity, logic. Amsterdam: North-Holland, 1989.
Знайти повний текст джерелаNies, André. Computability and randomness. Oxford: Oxford University Press, 2012.
Знайти повний текст джерелаComputability and randomness. New York: Oxford University Press, 2009.
Знайти повний текст джерелаJones, Neil D. Computability and complexity: From a programming perspective. Cambridge, Mass: MIT Press, 1997.
Знайти повний текст джерелаRich, Elaine. Automata, computability and complexity: Theory and applications. Upper Saddle River, N.J: Pearson Prentice Hall, 2008.
Знайти повний текст джерелаRon, Sigal, and Weyuker Elaine J, eds. Computability, complexity, and languages: Fundamentals of theoretical computer science. 2nd ed. Boston: Academic Press, Harcourt, Brace, 1994.
Знайти повний текст джерелаPetzold, Charles. The annotated Turing: A guided tour through Alan Turing's historic paper on computability. Indianapolis, IN: Wiley Pub., 2008.
Знайти повний текст джерела1966-, Blanck Jens, Brattka Vasco 1966-, and Hertling Peter 1965-, eds. Computability and complexity in analysis: 4th international workshop, CCA 2000, Swansea, UK, September 17-19, 2000 : selected papers. Berlin: Springer, 2001.
Знайти повний текст джерела1952-, Calude Cristian, Dinneen M. J. 1957-, and Sburlan Silviu, eds. Combinatorics, computability, and logic: Proceedings of the Third International Conference on Combinatorics, Computability, and Logic, (DMTCS '01). London: Springer, 2001.
Знайти повний текст джерелаA first course in logic: An introduction to model theory, proof theory, computability, and complexity. Oxford: Oxford University Press, 2004.
Знайти повний текст джерелаЧастини книг з теми "Computational complexity and computability"
Weihrauch, Klaus. "Computational Complexity." In Computability, 306–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-69965-8_23.
Повний текст джерелаNorman, Alfred Lorn. "Computability, Complexity and Economics." In Computational Techniques for Econometrics and Economic Analysis, 89–108. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-015-8372-5_6.
Повний текст джерелаTsuiki, Hideki. "Computational Dimension of Topological Spaces." In Computability and Complexity in Analysis, 323–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45335-0_19.
Повний текст джерелаWeihrauch, Klaus. "Constructivity, computability, and computational complexity in analysis." In Fundamentals of Computation Theory, 480–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51498-8_47.
Повний текст джерелаKohlenbach, Ulrich. "On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems." In Computability and Complexity in Analysis, 119–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45335-0_9.
Повний текст джерелаSelivanova, Svetlana. "Computational Complexity of Classical Solutions of Partial Differential Equations." In Revolutions and Revelations in Computability, 299–312. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-08740-0_25.
Повний текст джерелаWainer, Stanley S. "Computability — Logical and Recursive Complexity." In Logic, Algebra, and Computation, 237–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-76799-9_6.
Повний текст джерелаBournez, Olivier, Daniel S. Graça, Amaury Pouly, and Ning Zhong. "Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems." In Lecture Notes in Computer Science, 12–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39053-1_2.
Повний текст джерелаBridges, Douglas S. "Abstract Complexity Theory." In Computability, 93–115. New York, NY: Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-0863-1_7.
Повний текст джерелаAllender, Eric. "The Complexity of Complexity." In Computability and Complexity, 79–94. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-50062-1_6.
Повний текст джерелаТези доповідей конференцій з теми "Computational complexity and computability"
Py, Mônica Xavier, Laira Vieira Toscani, Luís C. Lamb, and Tiarajú Asmuz Diverio. "Learning Parallel Computing Concepts via a Turing Machine Simulator." In Simpósio de Arquitetura de Computadores e Processamento de Alto Desempenho. Sociedade Brasileira de Computação, 2001. http://dx.doi.org/10.5753/sbac-pad.2001.22201.
Повний текст джерелаdel Vado Vírseda, Rafael. "Computability and Algorithmic Complexity Questions in Secondary Education." In CompEd '19: ACM Global Computing Education Conference 2019. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3300115.3309507.
Повний текст джерелаYan, Song Y. "Computability, Learnability and Breakability in Cryptanalysis." In 2008 International Conference on Computational Intelligence for Modelling Control & Automation. IEEE, 2008. http://dx.doi.org/10.1109/cimca.2008.206.
Повний текст джерелаChakaravarthy, Venkatesan T. "New results on the computability and complexity of points--to analysis." In the 30th ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/604131.604142.
Повний текст джерелаPeng, Weiguang. "A Survey of the Distributional Complexity for AND-OR Trees." In The 9th International Conference on Computability Theory and Foundations of Mathematics. WORLD SCIENTIFIC, 2022. http://dx.doi.org/10.1142/9789811259296_0004.
Повний текст джерелаDobzinski, Shahar, and Jan Vondrak. "From query complexity to computational complexity." In the 44th symposium. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2213977.2214076.
Повний текст джерелаDecatur, Scott, Oded Goldreich, and Dana Ron. "Computational sample complexity." In the tenth annual conference. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/267460.267489.
Повний текст джерелаGoldreich, Oded, Rafail Ostrovsky, and Erez Petrank. "Computational complexity and knowledge complexity (extended abstract)." In the twenty-sixth annual ACM symposium. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/195058.195406.
Повний текст джерелаLinial, Nati, and Adi Shraibman. "Learning Complexity vs. Communication Complexity." In 2008 23rd Annual IEEE Conference on Computational Complexity. IEEE, 2008. http://dx.doi.org/10.1109/ccc.2008.28.
Повний текст джерелаGoldsmith, Simon F., Alex S. Aiken, and Daniel S. Wilkerson. "Measuring empirical computational complexity." In the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1287624.1287681.
Повний текст джерелаЗвіти організацій з теми "Computational complexity and computability"
Coward, John R. Computational Complexity and Encryption. Fort Belvoir, VA: Defense Technical Information Center, February 1995. http://dx.doi.org/10.21236/ada291910.
Повний текст джерелаLidar, Daniel. Quantum Computational Complexity of Spin Glasses. Fort Belvoir, VA: Defense Technical Information Center, March 2011. http://dx.doi.org/10.21236/ada545157.
Повний текст джерелаHeggernes, P., S. C. Eisenstat, G. Kumfert, and A. Pothen. The Computational Complexity of the Minimum Degree Algorithm. Office of Scientific and Technical Information (OSTI), December 2001. http://dx.doi.org/10.2172/15002765.
Повний текст джерелаHart, W. E. On the computational complexity of sequence design problems. Office of Scientific and Technical Information (OSTI), December 1996. http://dx.doi.org/10.2172/425316.
Повний текст джерелаHarris, D. Computational Complexity of Subspace Detectors and Matched Field Processing. Office of Scientific and Technical Information (OSTI), December 2010. http://dx.doi.org/10.2172/1017995.
Повний текст джерелаLumsdaine, Robin, James Stock, and David Wise. Three Models of Retirement: Computational Complexity Versus Predictive Validity. Cambridge, MA: National Bureau of Economic Research, December 1990. http://dx.doi.org/10.3386/w3558.
Повний текст джерелаBarlow, R. E., and S. Iyer. Computational Complexity of Coherent Systems and the Reliability Polynomial. Fort Belvoir, VA: Defense Technical Information Center, July 1985. http://dx.doi.org/10.21236/ada158689.
Повний текст джерелаReif, John H. Computational Complexity and Efficiency in Electro-Optical Computing Systems. Fort Belvoir, VA: Defense Technical Information Center, June 1990. http://dx.doi.org/10.21236/ada229195.
Повний текст джерелаBaader, Franz, and Oliver Fernández Gil. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.229.
Повний текст джерелаMurenzi, Romain, Lance Kaplan, Jean-Pierre Antoine, and Fernando Mujica. Computational Complexity of the Continuous Wavelet Transform in Two Dimensions. Fort Belvoir, VA: Defense Technical Information Center, January 1998. http://dx.doi.org/10.21236/ada358633.
Повний текст джерела