Search Results - Theory of computation Models of computation Computability

Models of high-level computation

Authors: Damian Arellanes

Source: Frontiers in Computer Science, Vol 7 (2025)

Subject Terms: models of computation, computability theory, high-level computation, compositionality, algebraic composition, Electronic computers. Computer science, QA75.5-76.95

File Description: electronic resource

Relation: https://www.frontiersin.org/articles/10.3389/fcomp.2025.1564048/full; https://doaj.org/toc/2624-9898

Access URL: https://doaj.org/article/7d9f5de19bf04c55be5d19288c7a6c49

History of Logo

Authors: Solomon, Cynthia Harvey, Brian Kahn, Ken et al.

Source: Proceedings of the ACM on Programming Languages. 4(HOPL)

Subject Terms: 4613 Theory Of Computation (for-2020), 46 Information and Computing Sciences (for-2020), 4612 Software Engineering (for-2020), 4 Quality Education (sdg), Logo, Lisp, Constructionism, Constructivism, turtle geometry, Education-Interactive learning environments, History of computingsHistory of programming languages, Computing educations- Computational thinking, Computing education programsDComputer science education, Informal education, Computing literacy, K-12 education (ages 5-18), Software notations and tools- General programming languages, Imperative languages, Functional languages, Language featuressControl structures, Data types and structures, Recursion, Procedures, functions and subroutines, Theory of computations-Models of computation-computabilitys-, Lambda calculus, Recursive functions, Interactive computation., Logo, Lisp, Constructionism, Constructivism, turtle geometry, Education– Interactive learning environments, History of computing–History of programming languages, Computing education– Computational thinking, Computing education programs—Computer science education, Informal education, Computing literacy, K-12 education (ages 5-18), Software notations and tools–General programming languages, Imperative languages, Functional languages, Language features–Control structures, Data types and structures, Recursion, Procedures, functions and subroutines, Theory of computation–Models of computation— Computability–Lambda calculus, Recursive functions, Interactive computation., 4612 Software engineering (for-2020), 4613 Theory of computation (for-2020), 4903 Numerical and computational mathematics (for-2020)

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/1623m1p3
https://escholarship.org/content/qt1623m1p3/qt1623m1p3.pdf

Realizing finitely presented groups as projective fundamental groups of SFTs

Authors: Paviet Salomon, Léo Vanier, Pascal Léo Paviet Salomon and Pascal Vanier

Contributors: Paviet Salomon, Léo Vanier, Pascal Léo Paviet Salomon and Pascal Vanier

Subject Terms: Wang tiles, Computability, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Theory of computation → Models of computation, Subshift of Finite Type, Mathematics of computing → Discrete mathematics, ddc:004, Fundamental Group, Dynamical Systems, Subshifts

File Description: application/pdf

Access URL: https://hal.science/hal-03622497v2/document
https://hal.science/hal-03622497v2
https://doi.org/10.4230/lipics.mfcs.2023.75
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.75

Computing with quanta—impacts of quantum theory on computation: Computing with quanta -- impacts of quantum theory on computation.

Authors: Mika Hirvensalo

Source: Theoretical Computer Science. 287:267-298

Subject Terms: Computability, Research exposition (monographs, survey articles) pertaining to quantum theory, Quantum computation, 0103 physical sciences, Hilbert space, 0102 computer and information sciences, Models of computation (Turing machines, etc.), Quantum computing, Linear operators, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

File Description: application/xml

Access URL: https://zbmath.org/1857018
https://doi.org/10.1016/s0304-3975(02)00096-8
https://www.sciencedirect.com/science/article/pii/S0304397502000968
https://dblp.uni-trier.de/db/journals/tcs/tcs287.html#Hirvensalo02
http://www.sciencedirect.com/science/article/pii/S0304397502000968

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines: On a theory of computation and complexity over the real numbers: NP- completeness, recursive functions and universal machines

Authors: Blum, Lenore Shub, Mike Smale, Steve

Source: Bull. Amer. Math. Soc. (N.S.) 21, no. 1 (1989), 1-46

Subject Terms: Complexity of computation (including implicit computational complexity), universal machine, Analysis of algorithms and problem complexity, computation theory, computation over the reals, 0102 computer and information sciences, 68Q15, Models of computation (Turing machines, etc.), recursive function, computation over an ordered ring, 4-feasibility problem, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, NP-completeness, 65V05, Applications of computability and recursion theory, 03D15, Turing machines and related notions, complements of Julia sets, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0101 mathematics, undecidable sets

File Description: application/xml; application/pdf

Access URL: https://www.ams.org/bull/1989-21-01/S0273-0979-1989-15750-9/S0273-0979-1989-15750-9.pdf
https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society-new-series/volume-21/issue-1/On-a-theory-of-computation-and-complexity-over-the-real/bams/1183555121.pdf
https://www.ams.org/bull/1989-21-01/S0273-0979-1989-15750-9/S0273-0979-1989-15750-9.pdf
https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society-new-series/volume-21/issue-1/On-a-theory-of-computation-and-complexity-over-the-real/bams/1183555121.full
https://projecteuclid.org/download/pdf_1/euclid.bams/1183555121
https://www.ams.org/journals/bull/1989-21-01/S0273-0979-1989-15750-9/
http://projecteuclid.org/euclid.bams/1183555121

Imperative Process Algebra and Models of Parallel Computation.

Authors: Middelburg, Cornelis A.¹ (AUTHOR) C.A.Middelburg@uva.nl

Source: Theory of Computing Systems. Jun2024, Vol. 68 Issue 3, p529-570. 42p.

Subject Terms: *TIME complexity, *ALGEBRA, *COMPUTATIONAL complexity, *ATHLETIC fields

Toward a generalized computability theory

Authors: I. V. Ashaev V. Ya. Belyaev A. G. Myasnikov

Source: Algebra and Logic. 32:183-205

Subject Terms: Recursively (computably) enumerable sets and degrees, algorithm, BSS-machines, recursive functions, Turing machines and related notions, algebraic systems, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, list extension, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies

File Description: application/xml

Access URL: https://zbmath.org/738953
https://doi.org/10.1007/bf02261744
https://link.springer.com/article/10.1007/BF02261744
https://link.springer.com/content/pdf/10.1007/BF02261744.pdf

Foundations of Software Science and Computation Structures

Authors: Jean Goubault-Larrecq Barbara König

Resource Type: eBook.

Subjects: Software engineering--Congresses, Computer software--Congresses

Categories: MATHEMATICS / Logic, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Programming / Compilers, COMPUTERS / Computer Science, COMPUTERS / Programming / General, COMPUTERS / Hardware / General, MATHEMATICS / Discrete Mathematics

Foundations of Software Science and Computation Structures : 21st International Conference, FOSSACS 2018, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings

Authors: Christel Baier Ugo Dal Lago

Resource Type: eBook.

Subjects: Computer software--Congresses, Software engineering--Congresses

Categories: COMPUTERS / Computer Science, BUSINESS & ECONOMICS / Careers / General, COMPUTERS / General, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Architecture, COMPUTERS / Software Development & Engineering / General, MATHEMATICS / Discrete Mathematics

Introduction to the Theory of Computation

Authors: K. Erciyes

Source: Undergraduate Topics in Computer Science ISBN: 9783030611149

Subject Terms: 4. Education

Access URL: https://link.springer.com/chapter/10.1007/978-3-030-61115-6_10
https://link.springer.com/content/pdf/10.1007%2F978-3-030-61115-6_10.pdf

Concrete and abstract models of computation over metric algebras

Authors: Stewart, K. J.

Subject Terms: 518

Access URL: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.639113

A new graph characteristic and its application to numerical computability

Authors: Harary, Frank Kreinovich, Vladik Longpre, Luc

Source: Information Processing Letters. 77:277-282

Subject Terms: graphs, 4. Education, computing with real numbers, 0211 other engineering and technologies, 02 engineering and technology, Models of computation (Turing machines, etc.), 01 natural sciences, 7. Clean energy, Graph theory (including graph drawing) in computer science, Computer Engineering, 0101 mathematics, 10. No inequality, theory of computation

File Description: application/xml; application/pdf

Access URL: https://digitalcommons.utep.edu/cgi/viewcontent.cgi?article=1562&context=cs_techrep
https://zbmath.org/1767247
https://doi.org/10.1016/s0020-0190(00)00153-8
https://scholarworks.utep.edu/cgi/viewcontent.cgi?article=1562&context=cs_techrep
https://scholarworks.utep.edu/cs_techrep/562/
https://www.sciencedirect.com/science/article/pii/S0020019000001538
https://dblp.uni-trier.de/db/journals/ipl/ipl77.html#HararyKL01
https://digitalcommons.utep.edu/cs_techrep/562/

Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II

Authors: Naoki Kobayashi James Worrell

Resource Type: eBook.

Subjects: Computer software--Congresses, Software engineering--Congresses

Categories: COMPUTERS / Computer Science, COMPUTERS / Computer Architecture, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Applied, MATHEMATICS / Logic

Proceedings of the Workshop on Computation: Theory and Practice (WCTP 2024)

Authors: Jaime Caro Shigeki Hagihara Shin-ya Nishizaki et al.

Resource Type: eBook.

Subjects: Computer science

Categories: COMPUTERS / General

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

Authors: Bournez, Olivier Graça, Daniel S. Pouly, Amaury et al.

Contributors: Bournez, Olivier Graça, Daniel S. Pouly, Amaury et al.

Source: Journal of the ACM

Subject Terms: FOS: Computer and information sciences, Computational Complexity, Computer systems organization, Implicit Complexity, Ordinary Diff, 1. No poverty, 0102 computer and information sciences, Computational Complexity (cs.CC), Mathematics of computing, 01 natural sciences, Continuous-Time Models of Computation, Computing methodologies, Computer Science - Computational Complexity, Computable Analysis, [INFO]Computer Science [cs], ddc:004, Analog Models of Computation, 0101 mathematics, Theory of computation

File Description: application/pdf

Access URL: http://arxiv.org/pdf/1601.05360
http://arxiv.org/abs/1601.05360
https://dblp.uni-trier.de/db/journals/jacm/jacm64.html#BournezGP17
https://dl.acm.org/citation.cfm?id=3127496
https://arxiv.org/pdf/1601.05360
https://dl.acm.org/doi/10.1145/3127496
https://arxiv.org/abs/1601.05360
https://cyberleninka.org/article/n/794324.pdf
https://arxiv.org/pdf/1601.05360.pdf
https://arxiv.org/abs/1601.05360
https://core.ac.uk/display/92441262
http://ui.adsabs.harvard.edu/abs/2016arXiv160105360B/abstract
http://drops.dagstuhl.de/opus/volltexte/2016/6244/pdf/LIPIcs-ICALP-2016-109.pdf/
https://drops.dagstuhl.de/opus/volltexte/2016/6244/pdf/LIPIcs-ICALP-2016-109.pdf/
https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#BournezGP16
https://drops.dagstuhl.de/opus/volltexte/2016/6244/
https://hdl.handle.net/10400.1/10075
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.109

Foundations of Software Science and Computation Structures

Authors: Patricia Bouyer Lutz Schröder

Resource Type: eBook.

Subjects: Information theory, Software engineering--Congresses, Computer software--Congresses, Computer systems

Categories: COMPUTERS / Computer Science, COMPUTERS / Computer Architecture, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Hardware / General, MATHEMATICS / Applied, MATHEMATICS / Logic

Proceedings of the Workshop on Computation: Theory and Practice (WCTP 2023)

Authors: Jaime Caro Shigeki Hagihara Shin-ya Nishizaki et al.

Resource Type: eBook.

Subjects: Computational complexity--Congresses, Computer science--Congresses

Categories: COMPUTERS / General

Foundations of Software Science and Computation Structures : 26th International Conference, FoSSaCS 2023, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings

Authors: Orna Kupferman Pawel Sobocinski

Resource Type: eBook.

Subjects: Computer software--Congresses, Software engineering--Congresses

Categories: COMPUTERS / Computer Science

Foundations of Software Science and Computation Structures : 24th International Conference, FOSSACS 2021, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings

Authors: Stefan Kiefer Christine Tasson

Resource Type: eBook.

Subjects: Software engineering--Congresses, Computer software--Congresses

Categories: COMPUTERS / Computer Science, COMPUTERS / Database Administration & Management, COMPUTERS / Programming / General, COMPUTERS / Speech & Audio Processing

WhileCC-approximability and Acceptability of Elementary Functions

Authors: Ghasemi, Fateme Zucker, Jeffery Computing and Software

Contributors: Ghasemi, Fateme Zucker, Jeffery Computing and Software

Subject Terms: Elementary functions, Theory of Computation, WhileCC-approximability

Access URL: http://hdl.handle.net/11375/31564