The Arithmetic-Algebra Connection: A Historical-Pedagogical Perspective K. Subramaniam and Rakhi Banerjee Abstract The problem of designing a teaching learning approach to symbolic algebra in the middle school that uses

Source URL: 158.144.44.204

Unified English Braille For Math For Sighted Learners By Heather Harland & Cheryl Roberts

Source URL: www.brailleauthority.org

• Binary operations
• Elementary arithmetic
• Blindness
• Assistive technology
• Mathematical notation
• Braille
• Number
• Multiplication
• Subtraction
• Division

ISAAC: A Convolutional Neural Network Accelerator with In-Situ Analog Arithmetic in Crossbars Ali Shafiee∗, Anirban Nag∗, Naveen Muralimanohar† , Rajeev Balasubramonian∗, John Paul Strachan†, Miao Hu† , R. St

Source URL: www.cs.utah.edu

THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape

Source URL: ludovicpatey.com

• Computability theory
• Computable function
• Computation in the limit
• Second-order arithmetic
• Compactness theorem
• Reverse mathematics
• 01 class
• PA degree
• Low
• Algorithmically random sequence
• Computable number

Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets Diego F. Aranha Department of Computer Science University of Bras´ılia Joint work with

Source URL: caramba.loria.fr

• Computer architecture
• Computing
• X86 instructions
• Binary arithmetic
• Computer engineering
• Central processing unit
• Computer arithmetic
• Instruction set
• Streaming SIMD Extensions
• Bitwise operation
• Bit manipulation
• SSSE3

Things that can and things that can’t be done in PRA Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Mathematical logic
• Mathematics
• Theoretical computer science
• Primitive recursive function
• Primitive recursive arithmetic
• ELEMENTARY
• Reverse mathematics
• Pairing function
• Ackermann function
• Sequence
• Recursion

PARITY OF THE PARTITION FUNCTION Ken Ono Abstract. Let p(n) denote the number of partitions of a non-negative integer n. A well-known conjecture asserts that every arithmetic progression contains infinitely many integer

Source URL: www.mathcs.emory.edu

UPPER TAILS FOR ARITHMETIC PROGRESSIONS IN A RANDOM SET BHASWAR B. BHATTACHARYA, SHIRSHENDU GANGULY, XUANCHENG SHAO, AND YUFEI ZHAO Abstract. Let Xk denote the number of k-term arithmetic progressions in a random subset

Source URL: yufeizhao.com

Reliable computing with GNU MPFR Paul Zimmermann ´ LORIA/INRIA Nancy-Grand Est, Equipe CARAMEL - bˆ atiment A,

Source URL: www.loria.fr

• Computer arithmetic
• GNU MPFR
• Rounding
• Paul Zimmermann
• GNU Multiple Precision Arithmetic Library
• SageMath
• Extended precision
• Floating point
• Interval arithmetic
• GNU Compiler Collection
• Precision
• IEEE floating point

A Multiplier Theorem Ka Hin Leung Department of Mathematics National University of Singapore Kent Ridge, SingaporeRepublic of Singapore

Source URL: www.ntu.edu.sg

• Algebra
• Mathematics
• Abstract algebra
• Group theory
• Combinatorics
• Order
• Divisor
• Difference set
• Multiplier
• Ring
• Algebraic number field
• Arithmetic function