Axel Thue
Encyclopedia
Axel Thue was a Norwegian
mathematician
, known for highly original work in diophantine approximation
, and combinatorics
.
He stated in 1914 the so-called word problem for semigroups or Thue problem, closely related to the halting problem
.
His only known PhD student was Thoralf Skolem
.
The esoteric programming language Thue
is named after him.
Norway
Norway , officially the Kingdom of Norway, is a Nordic unitary constitutional monarchy whose territory comprises the western portion of the Scandinavian Peninsula, Jan Mayen, and the Arctic archipelago of Svalbard and Bouvet Island. Norway has a total area of and a population of about 4.9 million...
mathematician
Mathematician
A mathematician is a person whose primary area of study is the field of mathematics. Mathematicians are concerned with quantity, structure, space, and change....
, known for highly original work in diophantine approximation
Diophantine approximation
In number theory, the field of Diophantine approximation, named after Diophantus of Alexandria, deals with the approximation of real numbers by rational numbers....
, and combinatorics
Combinatorics
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size , deciding when certain criteria can be met, and constructing and analyzing objects meeting the criteria ,...
.
He stated in 1914 the so-called word problem for semigroups or Thue problem, closely related to the halting problem
Halting problem
In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever...
.
His only known PhD student was Thoralf Skolem
Thoralf Skolem
Thoralf Albert Skolem was a Norwegian mathematician known mainly for his work on mathematical logic and set theory.-Life:...
.
The esoteric programming language Thue
Thue (programming language)
Thue is an esoteric programming language invented by John Colagioia in early 2000. It is a meta-language that can be used to define or recognize Type-0 languages from the Chomsky hierarchy. Because it is able to define languages of such complexity, it is also Turing-complete itself...
is named after him.
See also
- Semi-Thue systemSemi-Thue systemIn theoretical computer science and mathematical logic a string rewriting system , historically called a semi-Thue system, is a rewriting system over strings from a alphabet...
- Thue-Morse sequenceThue-Morse sequenceIn mathematics, the Thue–Morse sequence, or Prouhet–Thue–Morse sequence, is a binary sequence that begins:Any other ordered pair of symbols may be used instead of 0 and 1; the logical structure of the Thue–Morse sequence does not depend on the symbols that are used to represent it.- Direct...
- Thue-Siegel-Roth theorem
- Thue equationThue equationIn mathematics, a Thue equation is a Diophantine equation of the formwhere ƒ is an irreducible bivariate form of degree at least 3 over the rational numbers, and r is a nonzero rational number...
- Thue programming languageThue (programming language)Thue is an esoteric programming language invented by John Colagioia in early 2000. It is a meta-language that can be used to define or recognize Type-0 languages from the Chomsky hierarchy. Because it is able to define languages of such complexity, it is also Turing-complete itself...
- Thue's theorem
- Word ProblemWord problem for groupsIn mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G is the algorithmic problem of deciding whether two words in the generators represent the same element...