Статті в журналах з теми "Computational complexity and computability"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Computational complexity and computability".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерелаARRIGHI, PABLO, and GILLES DOWEK. "THE PHYSICAL CHURCH-TURING THESIS AND THE PRINCIPLES OF QUANTUM THEORY." International Journal of Foundations of Computer Science 23, no. 05 (August 2012): 1131–45. http://dx.doi.org/10.1142/s0129054112500153.
Повний текст джерелаWebb, Marcus, and Sheehan Olver. "Spectra of Jacobi Operators via Connection Coefficient Matrices." Communications in Mathematical Physics 382, no. 2 (February 22, 2021): 657–707. http://dx.doi.org/10.1007/s00220-021-03939-w.
Повний текст джерелаSong, Bosheng, Kenli Li, David Orellana-Martín, Mario J. Pérez-Jiménez, and Ignacio PéRez-Hurtado. "A Survey of Nature-Inspired Computing." ACM Computing Surveys 54, no. 1 (April 2021): 1–31. http://dx.doi.org/10.1145/3431234.
Повний текст джерелаAlford, Ron, Vikas Shivashankar, Ugur Kuter, and Dana Nau. "On the Feasibility of Planning Graph Style Heuristics for HTN Planning." Proceedings of the International Conference on Automated Planning and Scheduling 24 (May 10, 2014): 2–10. http://dx.doi.org/10.1609/icaps.v24i1.13630.
Повний текст джерелаMarlowe, Thomas J., and Laura Schoppmann. "Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula." Mathematical Problems in Engineering 4, no. 3 (1998): 247–66. http://dx.doi.org/10.1155/s1024123x98000817.
Повний текст джерелаBrattka, Vasco, and Vladik Kreinovich. "Computability and Complexity in Analysis (CCA). A View from Interval Computations -Cincinnati, Ohio, USA, August 28–30, 2003." Reliable Computing 10, no. 1 (2004): 75–80. http://dx.doi.org/10.1023/b:reom.0000004035.08919.ed.
Повний текст джерелаArmoni, Michal, Judith Gal-Ezer, and Dina Tirosh. "Solving Problems Reductively." Journal of Educational Computing Research 32, no. 2 (March 2005): 113–29. http://dx.doi.org/10.2190/6pcm-447v-wf7b-qeuf.
Повний текст джерелаArenas, Marcelo, Pablo BarcelÓ, and Mikaël Monet. "The Complexity of Counting Problems Over Incomplete Databases." ACM Transactions on Computational Logic 22, no. 4 (October 31, 2021): 1–52. http://dx.doi.org/10.1145/3461642.
Повний текст джерелаWANG, PEI. "PROBLEM SOLVING WITH INSUFFICIENT RESOURCES." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 12, no. 05 (October 2004): 673–700. http://dx.doi.org/10.1142/s0218488504003144.
Повний текст джерелаHayashi, Masahito, and Shun Watanabe. "Finite-Length Analyses for Source and Channel Coding on Markov Chains." Entropy 22, no. 4 (April 18, 2020): 460. http://dx.doi.org/10.3390/e22040460.
Повний текст джерелаDEAN, WALTER. "STRICT FINITISM, FEASIBILITY, AND THE SORITES." Review of Symbolic Logic 11, no. 2 (June 2018): 295–346. http://dx.doi.org/10.1017/s1755020318000163.
Повний текст джерелаTrella, Anna L., Kelly W. Zhang, Inbal Nahum-Shani, Vivek Shetty, Finale Doshi-Velez, and Susan A. Murphy. "Designing Reinforcement Learning Algorithms for Digital Interventions: Pre-Implementation Guidelines." Algorithms 15, no. 8 (July 22, 2022): 255. http://dx.doi.org/10.3390/a15080255.
Повний текст джерелаDOWNEY, RODNEY G., CARL G. JOCKUSCH, and PAUL E. SCHUPP. "ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS." Journal of Mathematical Logic 13, no. 02 (October 31, 2013): 1350005. http://dx.doi.org/10.1142/s0219061313500050.
Повний текст джерелаMinati, Gianfranco. "A Note on the Reality of Incomputable Real Numbers and Its Systemic Significance." Systems 9, no. 2 (June 12, 2021): 44. http://dx.doi.org/10.3390/systems9020044.
Повний текст джерелаZiegler, Martin. "Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra." Annals of Pure and Applied Logic 163, no. 8 (August 2012): 1108–39. http://dx.doi.org/10.1016/j.apal.2011.12.030.
Повний текст джерелаHarrington, Leo, and Robert I. Soare. "Codable sets and orbits of computably enumerable sets." Journal of Symbolic Logic 63, no. 1 (March 1998): 1–28. http://dx.doi.org/10.2307/2586583.
Повний текст джерелаHUET, GÉRARD. "Special issue on ‘Logical frameworks and metalanguages’." Journal of Functional Programming 13, no. 2 (March 2003): 257–60. http://dx.doi.org/10.1017/s0956796802004549.
Повний текст джерелаCase, John, and Timo Kötzing. "Computability-theoretic learning complexity." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 370, no. 1971 (July 28, 2012): 3570–96. http://dx.doi.org/10.1098/rsta.2011.0320.
Повний текст джерелаNorman, Alfred Lorn. "Computability, complexity and economics." Computational Economics 7, no. 1 (February 1994): 1–21. http://dx.doi.org/10.1007/bf01299326.
Повний текст джерелаDowney, Rod. "Computability, Complexity and Randomness." Theory of Computing Systems 52, no. 1 (October 5, 2012): 1. http://dx.doi.org/10.1007/s00224-012-9430-3.
Повний текст джерелаRustem, Berc, and Kumaraswamy Velupillai. "Rationality, computability, and complexity." Journal of Economic Dynamics and Control 14, no. 2 (May 1990): 419–32. http://dx.doi.org/10.1016/0165-1889(90)90027-e.
Повний текст джерелаBrattka, Vasco, Peter Hertling, Ker-I. Ko, and Hideki Tsuiki. "Computability and complexity in analysis." Journal of Complexity 22, no. 6 (December 2006): 728. http://dx.doi.org/10.1016/j.jco.2006.10.001.
Повний текст джерелаBarmpalias, George. "Algorithmic Randomness and Measures of Complexity." Bulletin of Symbolic Logic 19, no. 3 (September 2013): 318–50. http://dx.doi.org/10.1017/s1079898600010672.
Повний текст джерелаPalmore, Julian. "The New SciencesChaos, Complexity, and Computability." Military Operations Research 5, no. 3 (June 1, 2000): 5–7. http://dx.doi.org/10.5711/morj.5.3.5.
Повний текст джерелаChen, Jinhe, Decheng Ding, and Liang Yu. "Conference on Computability, Complexity and Randomness." Bulletin of Symbolic Logic 14, no. 4 (December 2008): 548–49. http://dx.doi.org/10.2178/bsl/1231081465.
Повний текст джерелаHiratsuka, Kota, Yuzuru Sato, and Zin Arai. "Computability and Complexity of Julia Sets." IEICE Proceeding Series 2 (March 17, 2014): 2–5. http://dx.doi.org/10.15248/proc.2.2.
Повний текст джерелаCockett, Robin, Joaquín Díaz-Boïls, Jonathan Gallagher, and Pavel Hrubeš. "Timed Sets, Functional Complexity, and Computability." Electronic Notes in Theoretical Computer Science 286 (September 2012): 117–37. http://dx.doi.org/10.1016/j.entcs.2012.08.009.
Повний текст джерелаHarizanov, Valentina S. "Computability-Theoretic Complexity of Countable Structures." Bulletin of Symbolic Logic 8, no. 4 (December 2002): 457–77. http://dx.doi.org/10.2178/bsl/1182353917.
Повний текст джерелаShoham, Yoav, and Moshe Tennenholtz. "On Rational Computability and Communication Complexity." Games and Economic Behavior 35, no. 1-2 (April 2001): 197–211. http://dx.doi.org/10.1006/game.2000.0833.
Повний текст джерелаLathrop, James I., Jack H. Lutz, Matthew J. Patitz, and Scott M. Summers. "Computability and Complexity in Self-assembly." Theory of Computing Systems 48, no. 3 (April 20, 2010): 617–47. http://dx.doi.org/10.1007/s00224-010-9252-0.
Повний текст джерелаAnalyti, Anastasia, Carlos Viegas Damásio, and Grigoris Antoniou. "Extended RDF: Computability and complexity issues." Annals of Mathematics and Artificial Intelligence 75, no. 3-4 (March 24, 2015): 267–334. http://dx.doi.org/10.1007/s10472-015-9451-0.
Повний текст джерелаČenek, E. W. "Computability and complexity theory and the complexity theory companion." ACM SIGACT News 33, no. 3 (September 2002): 17–19. http://dx.doi.org/10.1145/582475.582480.
Повний текст джерелаCsima, Barbara F., and Robert I. Soare. "Computability Results Used in Differential Geometry." Journal of Symbolic Logic 71, no. 4 (December 2006): 1394–410. http://dx.doi.org/10.2178/jsl/1164060462.
Повний текст джерелаCampani, Carlos A. P., and Paulo Blauth Menezes. "Teorias da Aleatoriedade." Revista de Informática Teórica e Aplicada 11, no. 2 (December 20, 2004): 75–98. http://dx.doi.org/10.22456/2175-2745.5983.
Повний текст джерелаDíaz, Josep, and Carme Torras. "Turing’s algorithmic lens: From computability to complexity theory." Arbor 189, no. 764 (December 30, 2013): a080. http://dx.doi.org/10.3989/arbor.2013.764n6003.
Повний текст джерелаHiratsuka, Kota, Yuzuru Sato, and Zin Arai. "Computability and complexity of Julia sets: a review." Nonlinear Theory and Its Applications, IEICE 5, no. 4 (2014): 410–23. http://dx.doi.org/10.1587/nolta.5.410.
Повний текст джерелаGreenberg, Noam. "Editorial: Special Issue on Computability, Complexity and Randomness." Theory of Computing Systems 58, no. 3 (July 24, 2015): 381–82. http://dx.doi.org/10.1007/s00224-015-9648-y.
Повний текст джерелаMiyabe, Kenshi. "L1-Computability, Layerwise Computability and Solovay Reducibility." Computability 2, no. 1 (2013): 15–29. http://dx.doi.org/10.3233/com-13015.
Повний текст джерела(Vela) Velupillai, K. "Expository notes on computability and complexity in (arithmetical) games." Journal of Economic Dynamics and Control 21, no. 6 (June 1997): 955–79. http://dx.doi.org/10.1016/s0165-1889(97)00012-2.
Повний текст джерелаIANOVSKI, EGOR, RUSSELL MILLER, KENG MENG NG, and ANDRÉ NIES. "COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY." Journal of Symbolic Logic 79, no. 3 (August 18, 2014): 859–81. http://dx.doi.org/10.1017/jsl.2013.33.
Повний текст джерела