Search Results - Computational complexity and computability

COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY

Authors: Pagin, Peter, 1953

Source: Compositionality The Review of Symbolic Logic. 14(3):551-591

Subject Terms: Compositionality, semantics, computational complexity, term rewriting, Theoretical Philosophy, teoretisk filosofi

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-202547
https://su.diva-portal.org/smash/get/diva2:1642171/FULLTEXT01.pdf

Calcolabilità e complessità.

Alternate Title: Computability and complexity.

Authors: Montresor, Alberto¹ alberto.montresor@unitn.it

Source: Nuova Secondaria. nov2025, Vol. 43 Issue 3, p91-95. 5p.

Subject Terms: *COMPUTATIONAL complexity, *ALGORITHMS, *COMPUTER science, *COMPUTATIONAL mathematics, *RECURSION theory, *PROBLEM solving

Computability and Complexity

Authors: Hubie Chen

Resource Type: eBook.

Subjects: Computational complexity

Categories: COMPUTERS / Computer Science, COMPUTERS / Machine Theory, COMPUTERS / Programming / Algorithms

A new language for TCS which is intuitive,rigorous and concise.(example from Computational Complexity:A Modern Approach)

Authors: Rui Song

Subject Terms: Computational complexity and computability, Theoretical computer science

Relation: https://figshare.com/articles/book/A_new_language_for_TCS_which_is_both_intuitive_and_rigorous_example_/29958854

Availability: https://doi.org/10.6084/m9.figshare.29958854.v17
https://figshare.com/articles/book/A_new_language_for_TCS_which_is_both_intuitive_and_rigorous_example_/29958854

The Computational Complexity of Subclasses of Semiperfect Rings

Authors: Huishan Wu

Source: Mathematics, Vol 12, Iss 22, p 3608 (2024)

Subject Terms: computability theory, computational complexity, semisimple ring, local ring, semiperfect ring, Mathematics, QA1-939

File Description: electronic resource

Relation: https://www.mdpi.com/2227-7390/12/22/3608; https://doaj.org/toc/2227-7390

Access URL: https://doaj.org/article/9d0a4b6241db43c2a6f88ead30d1a1b3

Computability and Complexity

Authors: Rod Downey

Resource Type: eBook.

Subjects: Computer science--Mathematics, Computable functions

Categories: COMPUTERS / Computer Science, COMPUTERS / Business & Productivity Software / General, MATHEMATICS / Logic, SCIENCE / System Theory

Minimality and computability of languages of G-shifts

Authors: Amir, Djamel Eddine de Menibus, Benjamin Hellouin Graphes, Algorithmes et Combinatoire - LISN (GALaC) et al.

Contributors: Amir, Djamel Eddine de Menibus, Benjamin Hellouin Graphes, Algorithmes et Combinatoire - LISN (GALaC) et al.

Source: ICALP 2025 ; https://hal.science/hal-05117426 ; ICALP 2025, Aarhus University, Jul 2025, Aarhus, Denmark ; https://conferences.au.dk/icalp2025

Subject Terms: shifts, subshifts, minimal shifts, computable language, computability, strong computable type, descriptive complexity, MSC 37B51 37B05 68Q17, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

Subject Geographic: Aarhus, Denmark

Availability: https://hal.science/hal-05117426
https://hal.science/hal-05117426v1/document
https://hal.science/hal-05117426v1/file/Computability_of_G-shifts__Preprint.pdf

Quantitative Coding and Complexity Theory of Continuous Data: Part I: Motivation, Definition, Consequences.

Authors: Lim, Donghyun Ziegler, Martin

Source: Journal of the ACM; Feb2025, Vol. 72 Issue 1, p1-39, 39p

Subject Terms: COMPUTABLE analysis, GENERALIZED spaces, COMPACT spaces (Topology), REAL numbers, CODING theory, METRIC spaces

Complexity of Finite Semigroups: History and Decidability.

Authors: Margolis, Stuart Rhodes, John Schilling, Anne

Source: Semigroup Forum. Oct2025, Vol. 111 Issue 2, p331-350. 20p.

Subject Terms: *SEMIGROUPS (Algebra), *COMPUTATIONAL complexity, *COMPUTABLE functions, *MATHEMATICS, *DECIDABILITY (Mathematical logic), *ALGEBRA, *MATHEMATICAL analysis

Morphogenetic computing: computability and complexity results.

Authors: Sosík, Petr¹ (AUTHOR) petr.sosik@fpf.slu.cz

Source: Natural Computing. Mar2023, Vol. 22 Issue 1, p161-170. 10p.

Subject Terms: *HOMEOSTASIS, *COMPUTATIONAL complexity, *GEOMETRIC shapes, *POLYTOPES

Computational complexity of sum-of-squares bounds for copositive programs

Authors: Palomba, Marilena Slot, Lucas Vargas, Luis Felipe et al.

Index Terms: Mathematics - Optimization and Control, Computer Science - Computational Complexity, 90C22, 90C23, 90C25, 90C27, 90C51, 90C60, text

URL: http://arxiv.org/abs/2501.03698

Computational Application of Physical Laws in 3D Programming Environments: An Analysis of Real-Time Simulation Systems

Authors: Elif Ceren Okur

Subject Terms: Simulation, modelling, and programming of mechatronics systems, Numerical modelling and mechanical characterisation, Computer vision and multimedia computation not elsewhere classified, Computational complexity and computability, Complex physical systems, Computational Physics, Real-Time Simulation, 3D Programming, Physics engines, collision detection methods, optimization algorithm LEA 3D

Availability: https://doi.org/10.6084/m9.figshare.29329937.v1
https://figshare.com/articles/journal_contribution/Computational_Application_of_Physical_Laws_in_3D_Programming_Environments_An_Analysis_of_Real-Time_Simulation_Systems/29329937

Transfinite Complexity Theory: Consciousness-Mediated Computation Beyond BQP

Authors: Rodgers, Jeremy

Subject Terms: Transfinite Complexity Theory, Consciousness-Augmented Computation, Λ-Field Invariants, Hyperfinite Limits, Phenomenal Projection Theorem, Computational Complexity Separation, Beyond BQP, Church–Turing Thesis Extension, Ordinal Recursion in Computation, Consciousness and Computability, Spectral Gap Lemma, Complexity Class CTC, Hypercomputation, Theoretical Computer Science, Mathematical logic, Computational Physics

Relation: https://zenodo.org/records/16889268; oai:zenodo.org:16889268; https://doi.org/10.5281/zenodo.16889268

Availability: https://doi.org/10.5281/zenodo.16889268
https://zenodo.org/records/16889268

The Universe as a Computational System - Mathematical Bases, Information Processing, and Physical Laws

Authors: Sandip Mehta

Subject Terms: Computational complexity and computability, Mathematical aspects of classical mechanics, quantum mechanics and quantum information theory, Mathematical aspects of general relativity, Mathematical physics not elsewhere classified, Numerical and computational mathematics not elsewhere classified, Computational universe, Quantum computation, Digital physics, Base e, Natural logarithms, Information theory, Quantum mechanics, General relativity, Computational chemistry, Interacting quantum atoms, Seth Lloyd, Stephen Wolfram, Konrad Zuse, Quantum information, Time dilation, Mathematical constants, Exponential functions, Boltzmann distribution, Wave function, Hyperbolic functions, Fundamental forces, Computational complexity

Availability: https://doi.org/10.6084/m9.figshare.28928342.v1
https://figshare.com/articles/preprint/The_Universe_as_a_Computational_System_-_Mathematical_Bases_Information_Processing_and_Physical_Laws/28928342

The Computational Complexity of Subclasses of Semiperfect Rings.

Authors: Wu, Huishan

Source: Mathematics (2227-7390); Nov2024, Vol. 12 Issue 22, p3608, 19p

Subject Terms: LOCAL rings (Algebra), NONCOMMUTATIVE algebras, COMPUTATIONAL complexity, IDEMPOTENTS, COMPLEXITY (Philosophy)

5. Computational Complexity

Authors: Kelly, J. S.

Source: Social Choice and Welfare, 1988 Jan 01. 5(4), 313-317.

Access URL: https://www.jstor.org/stable/41105907

A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations.

Authors: Blanc, Manon Bournez, Olivier

Source: International Journal of Foundations of Computer Science; Nov2025, Vol. 36 Issue 7, p989-1016, 28p

Subject Terms: COMPUTABLE functions, COMPUTABLE analysis, ORDINARY differential equations, LINEAR differential equations, POLYNOMIAL time algorithms, MATHEMATICAL functions, COMPUTATIONAL complexity

On the computational completeness of several descriptional complexity restrictions of semi-conditional grammars.

Authors: Fernau, Henning Kuppusamy, Lakshmanan Oladele, Rufus O.

Source: Computability. 2025, Vol. 14 Issue 1, p3-16. 14p.

Subject Terms: *COMPUTATIONAL complexity, *GRAMMAR

Computability

Authors: George Tourlakis

Resource Type: eBook.

Subjects: Computable functions, Recursion theory, Computational complexity, Computer science, Technology—Philosophy

Categories: COMPUTERS / Computer Science, MATHEMATICS / Logic, SCIENCE / Philosophy & Social Aspects, TECHNOLOGY & ENGINEERING / General

Computing strategies for multiple cops on infinite graphs.

Authors: McLeod, Alexa Solomon, Reed

Source: Computability. 2025, Vol. 14 Issue 1, p63-69. 7p.

Subject Terms: *COMPUTATIONAL complexity, *GRAPH theory, *ALGORITHMS