Search Results - "Models of Computation-computability theory"

Abstract computability and algebraic specification

Authors: J. V. Tucker The Pennsylvania State University CiteSeerX Archives

Contributors: J. V. Tucker The Pennsylvania State University CiteSeerX Archives

Source: http://arxiv.org/pdf/cs/0109001v1.pdf.

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.9470
http://arxiv.org/pdf/cs/0109001v1.pdf

Improved Witnessing and Local Improvement Principles for Second-Order Bounded Arithmetic

Authors: Arnold Beckmann Samuel R. Buss The Pennsylvania State University CiteSeerX Archives

Contributors: Arnold Beckmann Samuel R. Buss The Pennsylvania State University CiteSeerX Archives

Source: http://tocl.acm.org/accepted/beckmann_improved.pdf.

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.8592
http://tocl.acm.org/accepted/beckmann_improved.pdf

A domain-theoretic approach to Brownian motion and general continuous stochastic processes

Authors: Paul Bilokon Abbas Edalat The Pennsylvania State University CiteSeerX Archives

Contributors: Paul Bilokon Abbas Edalat The Pennsylvania State University CiteSeerX Archives

Source: http://www.doc.ic.ac.uk/~ae/papers/brownian.pdf.

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.639.119
http://www.doc.ic.ac.uk/~ae/papers/brownian.pdf

Models of high-level computation.

Authors: Arellanes, Damian

Source: Frontiers in Computer Science; 2025, p1-7, 7p

New Combinatorial Topology Bounds for Renaming: The Upper Bound.

Authors: CASTAÑEDA, ARMANDO RAJSBAUM, SERGIO

Source: Journal of the ACM; Feb2012, Vol. 59 Issue 1, p3-3:49, 49p

Subject Terms: COMBINATORIAL topology, MATHEMATICAL bounds, COMPUTABLE functions, DISTRIBUTED computing, MACHINE theory, ALGORITHMS, COMPUTER programming

Computers as Interactive Machines: Can We Build an Explanatory Abstraction?

Authors: Martin, Alice Magnaudet, Mathieu Conversy, Stéphane

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

Improved Witnessing and Local Improvement Principles for Second-Order Bounded Arithmetic.

Authors: BECKMANN, ARNOLD BUSS, SAMUEL R.

Source: ACM Transactions on Computational Logic; Feb2014, Vol. 15 Issue 1, p2:1-2:35, 35p

Subject Terms: ARITHMETIC, POLYNOMIALS, EXPONENTIAL functions, TOPOLOGY, MATHEMATICAL functions, LOGARITHMIC functions

A New Function Algebra of EXPTIME Functions by Safe Nested Recursion.

Authors: Arai, Toshiyasu Eguchi, Naohi

Source: ACM Transactions on Computational Logic; Aug2009, Vol. 10 Issue 4, p24-24:19, 19p

Subject Terms: FUNCTION algebras, POLYNOMIALS, RECURSION theory, EXPONENTIAL functions, DIFFERENTIAL equations

A study of some addition chain problems.

Authors: Tsai, Y.H. Chin, Y.H.

Source: International Journal of Computer Mathematics; Jan1987, Vol. 22 Issue 2, p117-134, 18p

Monoidal Category Theory : Unifying Concepts in Mathematics, Physics, and Computing

Authors: Noson S. Yanofsky

Resource Type: eBook.

Subjects: Monoids, Categories (Mathematics)

Categories: COMPUTERS / Computer Science, MATHEMATICS / Logic, SCIENCE / Physics / Mathematical & Computational