Search Results - Models of Computation-computability theory
-
1
Authors: et al.
Contributors: et al.
Source: Leibniz International Proceedings in Informatics (LIPIcs) ; International Colloquium on Automata, Languages, and Programming (ICALP) ; https://hal.science/hal-04664615 ; International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.129⟩
Subject Terms: Models of computation, Ordinary differential equations, Real computations, Analog computations, Complexity theory, Implicit complexity, Recursion scheme, Theory of computation → Models of computation, Theory of computation → Computability, Theory of computation → Complexity classes, Mathematics of computing → Ordinary differential equations, [INFO]Computer Science [cs]
Time: Tallinn, Estonia
-
2
Authors: JALALI, SEYED RASOUL
Subject Terms: Hamzah Equation, Gödel Incompleteness, Turing Halting Problem, Einstein Relativity, Fractal Derivatives, Complex Integration, ψ-topology, Consciousness Dynamics, Nonlinear Geometry, Phase Field, Quantum Singularity, Logical Undecidability, Self-Reference, Recursive Computation, Peano Arithmetic, Non-Euclidean Loops, Fractal Geometry, Attractor Basin, Computational Limit, Hyperdimensional Modeling, Mathematical Ontology, Algorithmic Halting, High-Order Derivatives, Formal Systems, Logical Entropy, Quantum Collapse, Error Propagation, Stability Index, Coherence Zone, Decidability, Complex Analysis, Complex Loop Integral, Modal Logic, Category Theory, Phase Resonance, ψ-space, Formal Logic, Recursive Trees, Gödel Sentence, Computational Irreducibility, Tensor Geometry, ψ-convergence, Quantum Geometry, Multi-Dimensional Topology, Singularity Breakdown, Entropic Divergence, Semantic Logic, Numerical Convergence, ψ-coherence, Computable Root, Infinite Regress, Halting Point, Logical Mapping, Algorithmic Complexity, Stability Mapping, Quantum Relativity, ψ-phase, Topological Encoding, ψ-fractal, Quantum Intelligence, Meta-Mathematics, Turing Machine, Gödel System, Phase Singularities, Logical Breakdown, Multiscale Modeling, Semantic Phase Field, Fractal Propagation, Tensor Field, Recursive Entropy, Phase-Convergent Logic, Incomplete Computation, Topological Resonance, ψ-dynamics, Cognitive Modeling, Fractal Time, ψ-operator, Singular Attractor, Information Geometry, Cognitive Phase Space, Hilbert Space, ψ-field, Meta-Formalism, Fractal Logic, Logical Stability, Quantum Computing, Gödelian Space, Cognitive Coherence, Non-Commutative Logic, Fractal Encoding, ψ-harmonics, Entropic Flow, Computational Ontology, Logical Continuum, Turing Landscape, Recursive Dimension, Hyper-Logical System, ψ-field Theory, Gödel Encoding, Fractal Singularity, Multi-Layer Logic, Modal Dynamics, Transfinite Logic, ψ-integration, Intelligent Algorithmics, Fractal Convergence, Fractal Derivation, Hamzah Dynamics, Gödel Fractals, Turing Fractals, Einstein Collapse, Logical Duality, Topological Coherence, Algorithmic Ontology, ψ-framework, Recursive Attractor, Cognitive Formalism, Quantized Halting, Intelligent Topology, Nonlinear Integration, Quantum Logic, Logical Field Theory, ψ-topological Logic, Self-Reflective Systems, ψ-zone, Halting Convergence, Logical Asymmetry, Formal Decidability, Computation Beyond Turing, Higher-Dimensional Logic, Geometric Consciousness, Algorithmic Continuum, ψ-network, Ontological Computation, ψ-algebra, Resonant Intelligence, Cognitive Equation, Complexity Geometry, Nonlinear Attractors, Topological Halting, ψ-entropy, Hyper-Fractals, Conscious Topology, Entangled Logic, Logical Emergence, Cognitive Phase, Entropic Limit, Mathematical Paradox, Recursive Model, ψ-theory, Modal Intelligence, Conscious Loops, ψ-infinitesimals, Recursive Topology, Gödel Limits, Logical Attractor, Quantum Mind, Intelligence Singularity, ψ-structure, ψ-integral Field, Logical Phase Geometry, High-Dimensional Logic, ψ-recursion, Phase-Space Integration, Modal Fields, Multivalued Logic, Logical Quantization, Hypergeometric Logic, Complexity Mapping, Nonlinear Computation, Computability Frontier, ψ-logic Field, ψ-derivatives, Quantum Meta-Logic, ψ-convergence Field, Gödel Operator, Hamzah Field Theory, Turing Geometry, Quantum Intelligence Model, ψ-embedding, ψ-quantum Field, Logical Integration, ψ-resolution, Conscious Fractals, ψ-mapping, Intelligent Singularities, Quantum-Turing Convergence, ψ-matrix, Cognitive Gradient, Entropic Roots, ψ-decomposition, Meta-Cognitive Logic, ψ-evolution, ψ-holographic Logic, Quantum Logic Network, Formal Incompleteness, ψ-space mapping, quantum computation, fractal logic networks, complex systems, logical attractors, dynamic recursion, nonlocal computation, quantum-classical interface, algorithmic boundaries, undecidable zones, phase geometry, mathematical consciousness, higher-order logic, recursive topologies, phase coherence, ψ-differentials, ψ-probability fields, error stability, entropic thresholds, singular logic, quantum information, ψ-integration manifold, ψ-fractal operators, dimensional recursion, quantum-algorithmic link, topological error space, ψ-harmonic model, transfinite recursion, computability flow, ψ-decision space, cognitive syntax, ψ-topological recursion, hyperdimensional logic, phase-aligned computation, ψ-manifold dynamics, multi-scale cognition, formal recursion maps, ψ-curvature, phase shift geometry, fractal-conscious systems, nonlinear logical flow, psi-calculus, higher-dimensional algebra, formal symmetry breaking, ψ-relativity, quantum-cognition model, ψ-spacetime curvature, algorithmic singularity, ψ-scalar field, recursive computation graphs, ψ-based logic gates, cognitive attractor fields, computational paradox resolution, mathematical structure collapse, fractal truth spaces, quantum-logic integration, recursive ψ-patterns, consciousness-based computation, nonbinary computation, phase discontinuities, phase synchrony in logic, topological self-reference, ψ-neural net dynamics, cognitive recursion models, ψ-operator algebra, quantized reasoning, ψ-frequency space, semantic recursion layers, ψ-informational field, ψ-reality model, paradox computation, ψ-logical fractal zone, time-deformed logic, ψ-reflexive systems, quantum reasoning field, coherence networks, recursive attractor fractals, computational ψ-trees, ψ-syntactic structure, non-deterministic intelligence, algorithmic quantum phase, fractal logical resonance, ψ-rhythmic computation, extended computation boundaries, ψ-quantized coherence, intelligence fractals, cognitive evolution via ψ, formal complexity convergence, ψ-singularity mapping, intelligent ψ-functions, entropy-logic interface, neural-logical integration, topological reasoning loops, deep logic networks, ψ-field attractors, recursive formal encoding, ψ-incompleteness solution, ψ-algorithm design, higher-phase logic, complex recursion geometry, abstract logic synthesis, intelligent ψ-loops, phase-based computation model, algorithmic cognition, emergent logic fields, ψ-expressiveness, quantum collapse modeling, ψ-symbolic convergence, recursive systems theory, logical error mapping, ψ-integral attractor, ψ-topological synthesis, field-based computation, Gödel-space resolution, fractal provability, quantum coherence logic, ψ-driven computation, higher formal abstractions, topological algorithm, ψ-resolution metrics, ψ-manifold attractor fields, topological ψ-field equations, nonclassical computational modeling, ψ-recursive phase mapping, ψ-based algorithmic learning, Gödel-Turing-Einstein synthesis, ψ-based knowledge formalism, intelligence computation limits, formal contradiction collapse, ψ-logical limit removal, dynamic ψ-encoding, complex neural logic, quantum-fractal networks, ψ-structured cognition, formal logic optimization, ψ-space recursion modeling, recursive ψ-inference, ψ-asymptotic dynamics, ψ-resolution graph, neural-fractal computation, recursive ψ-zones, quantum-aware logic, ψ-feedback systems, ψ-probabilistic determinacy, fractal knowledge architecture, recursive information theory, logical quantum modeling, ψ-error field, complex ψ-curves, ψ-equation solver, multidimensional recursion, quantum-logical phase transition, entangled computational fields, ψ-dimensional calculus, quantum-decision structure, ψ-activated logic cycles, non-Euclidean computation model, recursive theory architecture, ψ-information propagation, ψ-nonlocality, logical symmetry structures, abstract recursion logic, phase-determined reasoning, ψ-projection model, ψ-space formalism, advanced algorithmic ψ-field, topological cognition lattice, recursive ψ-tensor networks, intelligent phase processing, ψ-dynamic feedback system, consciousness-fractal field, ψ-conformal logic, algorithmic mind fields, logical ψ-waveforms, neural phase convergence, cognitive ψ-integration, ψ-code convergence, ψ-resonance algebra, non-deterministic recursion, quantum syntax modeling, recursive logic transposition, ψ-constructivist logic, formal hyperlogic, ψ-symbolic topology, multi-layered ψ-matrices, logic-to-phase mapping, trans-recursive systems
Access URL: https://zenodo.org/records/15858177
-
3
Authors: 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
-
4
Authors: et al.
Contributors: et al.
Source: 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025)
https://hal.science/hal-05241833
50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Aug 2025, Varsovie, Poland. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, ⟨10.4230/LIPIcs.MFCS.2025.29⟩Subject Terms: Theory of computation → Models of computation, Theory of computation → Computability, Theory of computation → Complexity classes, Computing methodologies → Neural networks, Formal neural networks, Complexity theory, Models of computation, [INFO]Computer Science [cs], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [SCCO.COMP]Cognitive science/Computer science
-
5
Authors: Rama, Tiago
Source: Foundations of Science; Sep2025, Vol. 30 Issue 3, p719-740, 22p
Subject Terms: COGNITIVE science, PHENOTYPES, HISTORICAL analysis, EVOLUTIONARY models
-
6
Authors: Tredinnick, Luke
Source: Information; Sep2025, Vol. 16 Issue 9, p791, 40p
Subject Terms: METATHEORY, THEMATIC analysis, THEORISTS, DISCOURSE, PRINCIPLE (Philosophy), INTERPRETATION (Philosophy)
-
7
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, F.1.1 (Computation by Abstract Devices, Models of Computation — computability theory, F.4.1 (Mathematical Logic and Formal Languages, Mathematical Logic — computability theory, proof theory General Terms, Abstract Computability, Algebraic Specification, Computable Analysis, Conditional Equations, Equational Logic, Metric Algebras Additional Key Words and Phrases, Birkhoff’s theorem, Grzegorczyk-Lacombe computability, initial algebras, term models, many-sorted algebras, Mal’cev’s theorem, topological algebras
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.9470; http://arxiv.org/pdf/cs/0109001v1.pdf
-
8
Authors: Arellanes, Damian
Source: Frontiers in Computer Science; 2025, p1-7, 7p
-
9
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: and Reasoning about Programs General Terms Languages, Security, Theory Keywords Virus Detection, Co-isolated Sets, Simple Sets, Program Self-Reference, Recursion Theorems
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.7836; http://www.cis.udel.edu/~case/papers/v_plas.pdf
-
10
Authors:
Source: Minds & Machines; Mar2023, Vol. 33 Issue 1, p83-112, 30p, 2 Diagrams
Subject Terms: HUMAN-computer interaction, COMPUTABLE functions, TURING machines, COMPUTERS, COMPUTER engineering
-
11
Authors: BREUVART, FLAVIEN
Source: Logical Methods in Computer Science (LMCS); 2016, Vol. 12 Issue 2, p1-34, 34p
Subject Terms: LAMBDA calculus, RECURSIVE functions, SEMANTICS, PROOF theory, MATHEMATICAL analysis, MATHEMATICAL domains
-
12
Authors: Velupillai, K. Vela
Source: Journal of Economic Surveys; Jul2011, Vol. 25 Issue 3, p401-430, 30p
-
13
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Computability theory, Proof theory, F.1.1 [Computation by Abstract Devices, Models of Computation—Computability theory General Terms, Theory Additional Key Words and Phrases, Bounded Arithmetic, Polynomial Space, Witnessing, Local Improvement, Provably Total Functions, NP Search Problems ACM Reference Format
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.8592; http://tocl.acm.org/accepted/beckmann_improved.pdf
-
14
Authors: Cyrus F. Nourani
Resource Type: eBook.
Categories: MATHEMATICS / Algebra / General, MATHEMATICS / Geometry / General, MATHEMATICS / Set Theory
-
15
Authors: Pégny, Maël
Thesis Advisors: Paris 1, Joinet, Jean-Baptiste, Grinbaum, Alexei
Subject Terms: Calcul quantique, Philosophie des sciences, Calcul, Informatique, Calculabilité, Complexité computationnelle, Thèse de Church-Turing, Quantum computing, Philosophy of science, Computing, Computer science, Computability, Computational complexity, Theory of Church-Turing, 160
Availability: http://www.theses.fr/2013PA010673/document
-
16
Authors:
Source: Journal of the ACM; Feb2012, Vol. 59 Issue 1, p3-3:49, 49p
-
17
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors F.1.1 [Theory of Compu- tation, Models of Computation—Computability theory, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Computability theory General Terms Algorithms, Design, Theory Keywords Brownian motion, Wiener measure, Domain theory, Stochastic processes, Computability
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.639.119; http://www.doc.ic.ac.uk/~ae/papers/brownian.pdf
-
18
Authors: et al.
Source: Entropy; May2024, Vol. 26 Issue 5, p426, 20p
Subject Terms: DYNAMICAL systems, GAUSS maps, INFORMATION theory, SIMPLICITY
-
19
Authors: et al.
Source: Industrial Engineering, Machine Design & Automation (Iemda 2014) - Proceedings of the 2014 Congress & Computer Science & Application (Ccsa 2014) - Proceedings of the 2nd Congress; 2015, p257-263, 7p
-
20
Authors: et al.
Source: Journal of the ACM; Jan2021, Vol. 68 Issue 1, p1-28, 28p
Subject Terms: PETRI nets, COMPUTER logic, DATABASES, COMPUTER science, FORMAL languages
Nájsť tento článok vo Web of Science
Full Text Finder