Suchergebnisse - "Theory of computation → Models of computation"
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Journal of the ACM.
Schlagwörter: FOS: Computer and information sciences, Theory of computation → Models of computation, Hyperclique Hypothesis, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, Reachability, Computational Complexity (cs.CC), Computer Science - Computational Complexity, Fine-Grained Complexity, Coverability, ddc:004, k-Cycle Hypothesis, Exponential Time Hypothesis, Vector Addition System
Dateibeschreibung: application/pdf
-
2
Autoren: et al.
Quelle: ACM Transactions on Cyber-Physical Systems, 8 (1), 1–23
Schlagwörter: ddc:004, 0209 industrial biotechnology, Theory of computation: Models of computation: Interactive computation, DATA processing & computer science, 05 social sciences, Theory of computation: Models of computation: Timed and hybrid models, 0501 psychology and cognitive sciences, 02 engineering and technology, concepts and paradigms, Human-centered computing: Interaction design: Interaction design theory, CCS CONCEPTS
Dateibeschreibung: application/pdf
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Symposium on Theoretical Aspects of Computer Science (STACS) ; https://hal.science/hal-04390697 ; Symposium on Theoretical Aspects of Computer Science (STACS), 2025, Jena, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, ⟨10.4230/LIPIcs.STACS.2025.21⟩
Schlagwörter: symbolic dynamics, Theory of computation → Models of computation, Mathematics of computing → Discrete mathematics, extender entropy, extender sets, tilings, subshifts, sofic shifts, computability, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]
-
4
Autoren:
Weitere Verfasser:
Schlagwörter: FO logic, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theory of computation → Models of computation, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Discrete Mathematics (cs.DM), Theory of computation → Formal languages and automata theory, cellular automata, [MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS], Cayley Graphs, MSO logic, Cellular Automata, Dynamical Systems (math.DS), Theory of computation → Logic, Cayley graphs, Logic in Computer Science (cs.LO), Domino Problem, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], domino problem, FOS: Mathematics, ddc:004, Mathematics - Dynamical Systems, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2404.16430
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.154
https://hal.science/hal-04558369v1
https://hal.science/hal-04558369v1/document
https://doi.org/10.4230/lipics.icalp.2024.154
https://hal.science/hal-04785124v1
https://doi.org/10.4230/lipics.icalp.2024.154 -
5
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Theory of computation → Models of computation, Mathematics of computing → Graph theory, STACS 2024, Theory of computation → Design and analysis of algorithms, Theory of computation → Formal languages and automata theory, Complete Volume, [INFO] Computer Science [cs], Volume 289, Theory of computation → Computational complexity and cryptography, Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs
Zugangs-URL: https://hal.science/hal-04859229v1
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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⟩
Schlagwörter: 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
-
7
Autoren: et al.
Quelle: Proceedings of the ACM on Programming Languages. 4(HOPL)
Schlagwörter: 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)
Dateibeschreibung: application/pdf
-
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Theory Comput Syst
Schlagwörter: FOS: Computer and information sciences, 2. Zero hunger, Recursive sequences, Theory of computation → Models of computation, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, Expressive power, [INFO] Computer Science [cs], 16. Peace & justice, 01 natural sciences, Article, expressive power, Higher-order pushdown automata, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ddc:004, weighted automata, 0101 mathematics, recursive sequences, higher-order pushdown automata, Weighted automata, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Dateibeschreibung: application/pdf
Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00224-021-10046-9.pdf
https://pubmed.ncbi.nlm.nih.gov/39183758
http://arxiv.org/abs/2002.08630
https://hal.science/hal-03098614v1
https://doi.org/10.4230/lipics.icalp.2020.117
https://hal.science/hal-03098614v1/document
https://dblp.uni-trier.de/db/conf/icalp/icalp2020.html#CadilhacMPPS20
https://drops.dagstuhl.de/opus/volltexte/2020/12524/pdf/LIPIcs-ICALP-2020-117.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12524/
https://doi.org/10.4230/LIPIcs.ICALP.2020.117
https://dblp.uni-trier.de/db/journals/corr/corr2002.html#abs-2002-08630
http://ui.adsabs.harvard.edu/abs/2020arXiv200208630C/abstract
https://link.springer.com/article/10.1007/s00224-021-10046-9
https://link.springer.com/content/pdf/10.1007/s00224-021-10046-9.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.117 -
9
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Theory of computation → Models of computation, Mathematics of computing → Graph theory, Theory of computation → Formal languages and automata theory, Theory of computation → Design and analysis of algorithms, [INFO] Computer Science [cs], Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs, Volume 254, STACS 2023, Complete Volume, STACS 2023, Complete Volume, ddc:004, Theory of computation → Computational complexity and cryptography, Volume 254, LIPIcs
Dateibeschreibung: application/pdf
-
10
Autoren:
Weitere Verfasser:
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 14th International Conference on Interactive Theorem Proving (ITP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 268, pp. 1-660, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)https://doi.org/10.4230/LIPIcs.ITP.2023
14th International Conference on Interactive Theorem Proving (ITP 2023)
https://hal.science/hal-04200527
14th International Conference on Interactive Theorem Proving (ITP 2023), Adam Naumowicz
René Thiemann, Jul 2023, Białystok, Poland. pp.21:1--17, ⟨10.4230/LIPIcs.ITP.2023.21⟩
https://mizar.uwb.edu.pl/ITP2023/program.htmlSchlagwörter: Theory of computation → Models of computation, µ-recursive functions, computational contents, Coq, extraction, OCaml, Theory of computation → Functional constructs, Software and its engineering → Formal methods, Software and its engineering → Functional languages, Theory of computation → Higher order logic phrases Unbounded linear search, Theory of computation → Type theory, [INFO]Computer Science [cs]
Time: Białystok, Poland
-
12
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 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⟩Schlagwörter: 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
-
13
Autoren: et al.
Weitere Verfasser: et al.
Quelle: FSCD 2022, International Conference on Formal Structures for Computation and Deduction ; https://hal.science/hal-03786122 ; FSCD 2022, International Conference on Formal Structures for Computation and Deduction, 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.17⟩
Schlagwörter: 2012 ACM Subject Classification Theory of computation → Models of computation, Theory of computation → Equational logic and rewriting, Theory of computation → Lambda calculus phrases rewriting, strategies, normalization, lambda calculus, probabilistic rewriting, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
-
14
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Theory of computation → Models of computation, Markov chains, Theory of computation → Program verification, Mathematics of computing → Probability and statistics, ddc:004, Markov decision processes
Dateibeschreibung: application/pdf
-
15
Autoren: et al.
Weitere Verfasser: et al.
Quelle: International Colloquium on Automata, Languages and Programming (ICALP) ; https://hal.science/hal-03133208 ; International Colloquium on Automata, Languages and Programming (ICALP), 2021, Glasgow ( Virtual ), United Kingdom. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021, ⟨10.4230/LIPIcs.ICALP.2021.122⟩
Schlagwörter: arithmetical hierarchy of real numbers, 2D subshifts, symbolic dynamics, Mathematics of computing → Discrete mathematics, Theory of computation → Models of computation, surface entropy, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]
Geographisches Schlagwort: Glasgow ( Virtual ), United Kingdom
-
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Open Access Series in Informatics (OASIcs), 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2021) ; nternational Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA) 2021 ; https://hal.science/hal-04574261 ; nternational Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA) 2021, Jul 2021, Marseille (CIRM, Centre International de Rencontres Mathématiques), France. pp.6:1 - 6:12, ⟨10.4230/OASIcs.AUTOMATA.2021.6⟩
Schlagwörter: cellular automata, dynamical systems, generic-limit sets, Rice’s theorem, subshifts, Theory of computation → Models of computation, [INFO]Computer Science [cs]
Geographisches Schlagwort: France
Time: Marseille (CIRM, Centre International de Rencontres Mathématiques), France
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2106.07907; ARXIV: 2106.07907
-
17
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs), 205
27th International Conference on DNA Computing and Molecular Programming (DNA 27)Schlagwörter: 0301 basic medicine, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), F.1, model of computation, maze-solving, F.1.1, F.1.2, F.1.3, Theory of computation → Computational geometry, Computer Science - Emerging Technologies, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, 03 medical and health sciences, small universal tile set, Boolean circuits, Theory of computation → Models of computation, Model of computation, self-assembly, Self-assembly, Maze-solving, Small universal title set, Computer Science - Computational Complexity, Emerging Technologies (cs.ET), ddc:004, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf; application/application/pdf; text
Zugangs-URL: http://arxiv.org/abs/2106.12341
https://arxiv.org/abs/2106.12341
https://www.research-collection.ethz.ch/handle/20.500.11850/507062
https://dblp.uni-trier.de/db/journals/corr/corr2106.html#abs-2106-12341
https://arxiv.org/pdf/2106.12341
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.27.8
http://hdl.handle.net/20.500.11850/507062
https://mural.maynoothuniversity.ie/id/eprint/15711/ -
18
Autoren: et al.
Weitere Verfasser: et al.
Quelle: STACS 2020 37th International Symposium on Theoretical Aspects of Computer Science ; https://hal.science/hal-02380657 ; STACS 2020 37th International Symposium on Theoretical Aspects of Computer Science, 2020, Montpellier, France. ⟨10.4230/LIPIcs.STACS.2020.26⟩
Schlagwörter: Dynamical Systems, Symbolic Dynamics, Subshifts, Wang tiles, Undecidability, Domino Problem, Combinatorics, Tilings, Subshifts of Finite Type, Theory of computation → Models of computation, Mathematics of computing → Combinatoric problems, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Geographisches Schlagwort: Montpellier, France
-
19
Autoren: et al.
Quelle: ACM Transactions on Computer-Human Interaction. 23:1-56
Schlagwörter: Theory of computation, Models of computation, 05 social sciences, Software and its engineering, Formal, 0202 electrical engineering, electronic engineering, information engineering, 0501 psychology and cognitive sciences, 02 engineering and technology, Bigraphs, Formal modelling, Mixed reality systems, Human-centered computing, Human computer interaction (HCI), Human- centered computing, HCI design and evaluation methods
Dateibeschreibung:
PDF ; application/pdf -
20
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 31st International Conference on Concurrency Theory
Leibniz International Proceedings in Informatics
31st International Conference on Concurrency Theory (CONCUR)Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, 0209 industrial biotechnology, Theory of computation → Models of computation, Theory of computation → Timed and hybrid models, 02 engineering and technology, [INFO] Computer Science [cs], Logic in Computer Science (cs.LO), Mathematics - Algebraic Geometry, algebraic invariants, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, ddc:004, Hybrid automata, Algebraic Geometry (math.AG)
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/1902.10452
http://ui.adsabs.harvard.edu/abs/2019arXiv190210452M/abstract
https://arxiv.org/pdf/1902.10452
https://arxiv.org/abs/1902.10452
https://pure.mpg.de/pubman/item/item_3316421_2/component/file_3341981/LIPIcs-CONCUR-2020-32.pdf
https://doi.org/10.4230/LIPIcs.CONCUR.2020.32
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3316421
https://dblp.uni-trier.de/db/journals/corr/corr1902.html#abs-1902-10452
https://arxiv.org/abs/1902.10452
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.32
http://hdl.handle.net/21.11116/0000-0008-6A71-2
http://hdl.handle.net/21.11116/0000-0009-2F12-F
https://hal.science/hal-03011136v1
Full Text Finder 
Nájsť tento článok vo Web of Science