Search this site:
-
A
A
+
A
Skip to Main Content
Home
Collections
Communities
TECHnologies
Login
CONTRIBUTE RESOURCES
About
PlanetMath
Lists:
Briggsian logarithms
table of common logarithms
Polish notation
shunting yard algorithm
more examples of reverse Polish notation
more examples of Polish notation
reverse Polish notation
many-sorted language
many-sorted structure
logical graph : introduction
ampheck
Peirce's law
praeclarum theorema
sole sufficient operator
logical graph : formal development
Thue system
semi-Thue system
Post system
automaton
automatic presentation
theory of formal languages
formal grammar
equivalent grammars
semiautomaton
state-output machine
equivalent machines
product of automata
Boolean operations on automata
equivalent automata
Epsilon Transition
juxtaposition of automata
Kleene star of an automaton
quantum automata and computation
category of automata
category of quantum automata
artificial intelligence
strong AI thesis
generalized sequential machine
rational transducer
Mealy machine
Moore machine
subsemiautomaton
characteristic monoid
semiautomaton homomorphism
simplified automaton
every $epsilon$-automaton is equivalent to an automaton
Turing computable
Turing machine
non-deterministic pushdown automaton
deterministic pushdown automaton
Markov algorithm
LR(k)
LL(k)
Kleene's theorem
deterministic finite automaton
non-deterministic finite automaton
reduced automaton
subset construction
constructing automata from regular languages
matrix characterizations of automata
unlimited register machine
examples of unlimited register machines
URM computable
combining URMs
recursive function is URM-computable
formal definition of a Turing machine
supercategory theories
non-commutative dynamic modeling diagrams
complex systems biology
similarity and analogous systems: dynamic adjointness and topological equivalence
primitive recursive function
recurrence relation
recursive function
alternative characterizations of recursive functions
pairing function
characterization of primitive recursive functions of one variable
examples of simple recurrence relations
applications of second order recurrence relation formula
formula for sequences satisfying second order recurrence relations
recursive set
examples of primitive recursive functions
bounded minimization
importance of primitive recursion
bounded maximization
examples of primitive recursive predicates
Mu Operator
more examples of primitive recursive functions
course-of-values recursion
encoding words
primitive recursive encoding
examples of primitive recursive encoding
mutual recursion
primitive recursive vector-valued function
alternative characterization of primitive recursiveness
elementary recursive function
bounded recursion
superexponentiation is not elementary
properties of superexponentiation
primitive recursive functions without primitive recursion
definition by cases
recursively enumerable
computable number
index set
index set theorem
primitive recursive number
word
Chomsky hierarchy
closure properties on languages
Ackermann function
halting problem
properties of Ackermann function
Ackermann function is not primitive recursive
computing the Ackermann function
Ackermann function is total recursive
Penrose's first G"odelian argument
Penrose's second G"odelian argument
weak AI thesis
Diophantine set
multigrade operator
minimal negation operator
grounded relation
categorical algebra
topic entry on the algebraic foundations of mathematics
Jordan-Banach and Jordan-Lie algebras
topic on the algebraic foundations of quantum algebraic topology
algebraic categories and classes of algebras
quadratic sieve
Pollard's $ ho$
cryptography and number theory
test for primality of Mersenne numbers
Solovay-Strassen test
Miller-Rabin prime test
symbolic computation
Kolakoski sequence
continued fraction
method for computing simple continued fractions with the aid of calculator and pencil and paper
convergents to a continued fraction
purely periodic continued fractions
periodic continued fractions represent quadratic irrationals
Cantor-Zassenhaus split
calculating the Jacobi symbol
squarefree factorization
Shanks-Tonelli algorithm
Vieta's formula
proof of Vieta's formula
Horner's rule
translation automorphism of a polynomial ring
zero polynomial
evaluation homomorphism
grouping method for factoring polynomials
factoring all-one polynomials using the grouping method
a polynomial of degree $n$ over a field has at most $n$ roots
polynomial ring over integral domain
polynomial ring
algebraic equation
topics on polynomials
how to multiply polynomials
polynomial ring which is PID
opposite polynomial
rules of calculus for derivative of polynomial
derivative of polynomial
zero of polynomial
rules of calculus for derivative of formal power series
generators of a quotient polynomial ring
Gr"obner basis
example of resultant (1)
example of resultant (2)
derivation of Sylvester's matrix for the resultant
resultant
proof that Sylvester's matrix equals the resultant
finding the order of a group
proof of uniqueness of Lagrange Interpolation formula
Vandermonde interpolation approach
Lagrange interpolation formula
linear interpolation
interpolation
B-spline
Bernstein polynomial
properties of Bernstein polynomial
quadrature
proof of Simpson's rule
Newton and Cotes formulas
Simpson's rule
code for Simpson's rule
rounding
Dynamic Stream
XML
topic entry on applied mathematics
topic on applied mathematical physics and physical mathematics
OpenPFGW
efficiency
proof of Amdahl's Law
Amdahl's Law
multisieve
overload
iterator
list of overloaded symbols
Haskell
BASIC
FORTRAN
C
C++
Java
JavaScript
Church integer
Horn clause
Boolean domain
Boolean-valued function
not a number
good hash table primes
hashing
heap removal algorithm
heap insertion algorithm
heap
binary tree
queue
stack
push
pop
binary search tree
search tree
2-3 tree
BB(alpha) tree
balance
B-tree
key
code
lower bound for sorting
bubblesort
digital search tree
sorting problem
quicksort
binary search
stable sorting algorithm
in-place sorting algorithm
heapsort
selection sort
insertion sort
red-black tree
height-balanced tree
relation theory
relation composition
relation construction
relation reduction
tacit extension
geometric representation of relation composition
algebraic representation of relation composition
matrix representation of relation composition
graph-theoretic representation of relation composition
logical matrix
Heaps' law
Zipf's law
transition event
trie
scenario
descriptive metadata specification
Hypertext
system state
cognitive science
computer representation of integers
arithmetic encoding
entropy encoding
Huffman's algorithm
Huffman coding
binary Gray code
Graham's number
run-length encoding
higher-order function
currying
explicit form for currying
Continuant polynomial
non-deterministic Turing machine
deterministic Turing machine
Cook reduction
Levin reduction
oracle
self-reducible
universal Turing machine
quantum nano-automata
random Turing machine
time complexity
constructible
counting complexity class
NP-complete
complexity class
polynomial hierarchy
polynomial hierarchy is a hierarchy
nonogram
counting problem
promise problem
range problem
decision problem
search problem
Stirling's approximation
asymptotic bounds for factorial
weaker version of Stirling's approximation
computationally indistinguishable
support
hard core
pseudorandom
pseudorandom generator
natural numbers identified with binary strings
invariance theorem
Kolmogorov complexity upper bounds
distribution ensemble
Kolmogorov complexity function
one-way function
Kolmogorov complexity
diamond lemma
Chomsky normal form
pumping lemma (regular languages)
pumping lemma (context-free languages)
context-sensitive language
Backus-Naur form
confluence
Church-Rosser property
normalizing reduction
terminating reduction
Kuroda normal form
regular language
context-free language
leftmost derivation
ambiguous grammar
Greibach normal form
Dyck language
Chomsky-Sch"utzenberger theorem
Parikh's theorem
linear language
derivation language
definite language
locally testable
star-free
derivation tree
derivation tree of a derivation
standard enumeration
convolution
homomorphism of languages
substitution
quotient of languages
reversal
shuffle of languages
language
insertion operation on languages
deletion operation on languages
metalinear language
Lindenmayer system
linear bounded automaton
restricted homomorphism
abstract family of languages
Fine and Wilf's theorem on words
Post correspondence problem
monad
characterization of a Kleene algebra
Kleene star
concatenation
alternative treatment of concatenation
Kleene algebra
regular expression
Nerode equivalence
Myhill-Nerode theorem
syntactic congruence
Myhill-Nerode theorem for semigroups
commutative language
star height
equivalent regular expressions
linear erasing
rational set
generalized regular expression
automaton over a monoid
Floyd's algorithm
digital library structure
Prouhet-Thue-Morse sequence
Hough transform
Pick's theorem
proof of Pick's theorem
aliasing
precision recall
one-pass algorithm to compute sample variance
algorithm
speedup
Mathematica
Maple
MATLAB
list of name and Greek letter functions and constants in Mathematica
quantum logic toposes
supercomputers
139 reads
Powered by
Drupal
, an open source content management system.
Arch images by
criminalintent
,
auntlaura
, and
geishaboy500
.
CC BY-SA 2.0