-
1
المؤلفون: Philipp Czerner, Stefan Jaax
المصدر: Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science ISBN: 9783030719944
FoSSaCS
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
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Foundations of Software Science and Computation Structuresمصطلحات موضوعية: FOS: Computer and information sciences, Unary operation, Population, complexity theory, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Article, Turing machine, symbols.namesake, distributed computing, 0202 electrical engineering, electronic engineering, information engineering, education, Time complexity, Mathematics, Discrete mathematics, 020203 distributed computing, education.field_of_study, Model of computation, NSPACE, Extension (predicate logic), 16. Peace & justice, broadcast protocols, Decidability, Computer Science - Distributed, Parallel, and Cluster Computing, 010201 computation theory & mathematics, symbols, Distributed, Parallel, and Cluster Computing (cs.DC)
-
2
المؤلفون: Frank Vega
المساهمون: Joysonic
مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Conjecture, Mathematics::General Mathematics, conjecture, Mathematics::Number Theory, computational_mathematics, NSPACE, Twin prime, reduction, Computer Science::Computational Complexity, complexity classes, regular languages, Combinatorics, primes, Riemann hypothesis, symbols.namesake, Goldbach's weak conjecture, Number theory, number theory, Goldbach's conjecture, symbols, Counterexample, Mathematics
وصف الملف: application/pdf
-
3
المؤلفون: Nestor Diaz
المصدر: Complex Systems. 26:283-294
مصطلحات موضوعية: Theoretical computer science, General Computer Science, Computer science, Probabilistic Turing machine, Description number, Multitape Turing machine, 02 engineering and technology, Machine learning, computer.software_genre, law.invention, Turing machine, symbols.namesake, Non-deterministic Turing machine, law, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, business.industry, Turing machine examples, 05 social sciences, NSPACE, Control and Systems Engineering, symbols, 020201 artificial intelligence & image processing, Universal Turing machine, Artificial intelligence, business, computer, 050212 sport, leisure & tourism
-
4
المؤلفون: Stanislav Žák, Jiří Šíma
المصدر: Fundamenta Informaticae. 152:397-409
مصطلحات موضوعية: 060201 languages & linguistics, Discrete mathematics, Algebra and Number Theory, DTIME, Computer science, 2-EXPTIME, NSPACE, 06 humanities and the arts, 02 engineering and technology, Theoretical Computer Science, Combinatorics, Nondeterministic algorithm, Turing machine, symbols.namesake, Computational Theory and Mathematics, 0602 languages and literature, 0202 electrical engineering, electronic engineering, information engineering, Complexity class, symbols, 020201 artificial intelligence & image processing, Time hierarchy theorem, Blum's speedup theorem, Information Systems
-
5
المؤلفون: Viliam Geffert
المصدر: Information and Computation. 253:163-178
مصطلحات موضوعية: Discrete mathematics, DTIME, Computational complexity theory, Open problem, NSPACE, 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Complexity, Space (mathematics), 01 natural sciences, Computer Science Applications, Theoretical Computer Science, Combinatorics, Nondeterministic algorithm, Turing machine, symbols.namesake, Computational Theory and Mathematics, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, symbols, Information Systems, Mathematics, Complement (set theory)
-
6
المؤلفون: V. N. Zakharov, V. A. Kozmidiadi
المصدر: Computational Mathematics and Mathematical Physics. 57:726-738
مصطلحات موضوعية: Discrete mathematics, Theoretical computer science, Computational complexity theory, DTIME, Super-recursive algorithm, 2-EXPTIME, NSPACE, Computational Mathematics, Turing machine, symbols.namesake, symbols, Time hierarchy theorem, Alternating Turing machine, Mathematics
-
7
المؤلفون: Fernando Arroyo, Stefan Popescu, Victor Mitrana, Sandra Gómez Canaval
المصدر: Information and Computation. 253:371-380
مصطلحات موضوعية: DTIME, 2-EXPTIME, Computer science, Computation, Linear speedup theorem, NSPACE, DSPACE, 0102 computer and information sciences, 02 engineering and technology, Parallel computing, 01 natural sciences, Computer Science Applications, Theoretical Computer Science, Turing machine, symbols.namesake, Computational Theory and Mathematics, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, symbols, 020201 artificial intelligence & image processing, Alphabet, Time complexity, Algorithm, Information Systems
-
8
المؤلفون: E.E Ogheneovo
المصدر: Advances in Multidisciplinary & Scientific Research Journal Publication. 4:1-12
مصطلحات موضوعية: Theoretical computer science, DTIME, Probabilistic Turing machine, Computer science, Super-recursive algorithm, Turing machine examples, NSPACE, General Medicine, law.invention, symbols.namesake, Turing machine, Non-deterministic Turing machine, law, symbols, Universal Turing machine, Algorithm
-
9
المؤلفون: Murray Elder, Laura Ciobanu, Volker Diekert
المصدر: Automata, Languages, and Programming ISBN: 9783662476659
ICALP (2)
International Journal of Algebra and Computationمصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), General Mathematics, Computer Science - Formal Languages and Automata Theory, Group Theory (math.GR), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Indexed language, Free monoid, FOS: Mathematics, Artificial Intelligence & Image Processing, 0101 mathematics, Time complexity, 03D05, 20F65, 20F70, 68Q25, 68Q45, Mathematics, Discrete mathematics, Diophantine equation, 010102 general mathematics, NSPACE, Solution set, Directed graph, Logic in Computer Science (cs.LO), Nondeterministic algorithm, Algebra, Computer Science - Computational Complexity, Free product, 010201 computation theory & mathematics, Free group, Mathematics - Group Theory, Computer Science::Formal Languages and Automata Theory
وصف الملف: application/pdf
-
10
المؤلفون: Alexander N. Rybalov
المصدر: Theory of Computing Systems. 60:671-676
مصطلحات موضوعية: Discrete mathematics, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Super-recursive algorithm, Turing machine examples, 010102 general mathematics, NSPACE, Description number, 0102 computer and information sciences, Computer Science::Computational Complexity, 01 natural sciences, Theoretical Computer Science, law.invention, Turing machine, symbols.namesake, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, 010201 computation theory & mathematics, law, Turing reduction, symbols, Universal Turing machine, Time hierarchy theorem, 0101 mathematics, Computer Science::Formal Languages and Automata Theory, Mathematics
-
11
المؤلفون: Simone Pinna, Marco Giunti
المصدر: Logic Journal of IGPL. 24:557-569
مصطلحات موضوعية: Theoretical computer science, Logic, business.industry, Computer science, 05 social sciences, NSPACE, 050105 experimental psychology, 03 medical and health sciences, Turing machine, symbols.namesake, 0302 clinical medicine, Non-deterministic Turing machine, Embodied cognition, Human computation, symbols, 0501 psychology and cognitive sciences, Artificial intelligence, business, 030217 neurology & neurosurgery, Human-based computation
-
12
المؤلفون: Ofra Rechter, Eli Dresner
المصدر: Minds and Machines. 26:253-257
مصطلحات موضوعية: TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Computer science, Super-recursive algorithm, Description number, Computer Science::Computational Complexity, 0603 philosophy, ethics and religion, 050105 experimental psychology, law.invention, Turing machine, symbols.namesake, Non-deterministic Turing machine, Artificial Intelligence, law, Computer Science::General Literature, 0501 psychology and cognitive sciences, Turing, computer.programming_language, Cognitive science, Turing machine examples, 05 social sciences, NSPACE, TheoryofComputation_GENERAL, 06 humanities and the arts, Philosophy, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 060302 philosophy, symbols, Universal Turing machine, computer, Computer Science::Formal Languages and Automata Theory
-
13
المصدر: Membrane Computing ISBN: 9783030127961
Int. Conf. on Membrane Computingمصطلحات موضوعية: Discrete mathematics, Computation, String (computer science), NSPACE, 0102 computer and information sciences, 02 engineering and technology, Binary logarithm, 01 natural sciences, Automaton, Nondeterministic algorithm, 010201 computation theory & mathematics, Position (vector), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Word (computer architecture), Mathematics
-
14
المؤلفون: Andrea Asperti, Wilmer Ricciotti
المساهمون: Asperti, Andrea, Ricciotti, Wilmer
المصدر: Asperti, A & Ricciotti, W 2015, ' A formalization of multi-tape Turing machines ', Theoretical Computer Science, vol. 603, pp. 23-42 . https://doi.org/10.1016/j.tcs.2015.07.013
مصطلحات موضوعية: Certified correctne, Theoretical computer science, Interactive theorem proving, General Computer Science, Computational complexity theory, Computer science, Probabilistic Turing machine, Super-recursive algorithm, DSPACE, computer.software_genre, Theoretical Computer Science, law.invention, Turing machine, symbols.namesake, Turing completeness, Non-deterministic Turing machine, law, Computer Science::Logic in Computer Science, Matita, Algorithm characterizations, PSPACE, Programming language, Turing machine examples, Universal machine, Computer Science (all), Proof assistant, NSPACE, Automated theorem proving, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Turing reduction, symbols, Time hierarchy theorem, Universal Turing machine, Automatic verification, Alternating Turing machine, computer
وصف الملف: STAMPA; application/pdf
-
15
المؤلفون: Colin Klein
المصدر: Philosophia. 43:925-931
مصطلحات موضوعية: Super-recursive algorithm, Computer science, 05 social sciences, NSPACE, Description number, 06 humanities and the arts, 0603 philosophy, ethics and religion, law.invention, Philosophy, Turing machine, symbols.namesake, Non-deterministic Turing machine, law, 060302 philosophy, 0502 economics and business, symbols, Universal Turing machine, Time hierarchy theorem, Mathematical economics, Turing, computer, 050203 business & management, computer.programming_language
-
16
المؤلفون: Raluca Diaconu, Ferucio Laurentiu Tiplea
المصدر: IEEE Transactions on Systems, Man, and Cybernetics: Systems. 45:496-507
مصطلحات موضوعية: Theoretical computer science, Computational complexity theory, DTIME, Probabilistic Turing machine, Computer science, 2-EXPTIME, Super-recursive algorithm, DSPACE, symbols.namesake, Turing machine, Computable function, Complexity class, Algorithm characterizations, Electrical and Electronic Engineering, Circuit complexity, PSPACE, Recursion, NSPACE, Petri net, μ-recursive function, Computer Science Applications, Human-Computer Interaction, Control and Systems Engineering, Turing reduction, symbols, Time hierarchy theorem, Software
-
17
المصدر: Turing-100
مصطلحات موضوعية: Discrete mathematics, Quantum Turing machine, Computer science, Probabilistic Turing machine, Super-recursive algorithm, NSPACE, law.invention, symbols.namesake, Turing machine, Non-deterministic Turing machine, law, symbols, Time hierarchy theorem, Universal Turing machine
-
18
المؤلفون: Peter Wegner, Eugene Eberbach, Mark Burgin
المصدر: Turing-100
مصطلحات موضوعية: Turing machine, symbols.namesake, Theoretical computer science, Computational complexity theory, Computer science, Super-recursive algorithm, Turing machine examples, Linear speedup theorem, NSPACE, symbols, Description number, Time hierarchy theorem
-
19
المؤلفون: Edgar G. Daylight
المصدر: Turing-100
مصطلحات موضوعية: Theoretical computer science, Computer science, Probabilistic Turing machine, Super-recursive algorithm, Turing machine examples, NSPACE, law.invention, Turing machine, symbols.namesake, Non-deterministic Turing machine, law, symbols, Universal Turing machine, Time hierarchy theorem
-
20
المؤلفون: André Souto, Paulo Mateus, Amílcar Sernadas
المصدر: Journal of Logic and Computation. 27:1-19
مصطلحات موضوعية: Discrete mathematics, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Quantum Turing machine, Logic, 2-EXPTIME, Probabilistic Turing machine, Super-recursive algorithm, 010102 general mathematics, NSPACE, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, law.invention, symbols.namesake, Turing machine, Arts and Humanities (miscellaneous), Non-deterministic Turing machine, 010201 computation theory & mathematics, Hardware and Architecture, law, symbols, Universal Turing machine, 0101 mathematics, Software, Mathematics