TuringBot - Symbolic Regression Software

Automatically discover mathematical equations.

TuringBot finds the actual formula hiding in your data. Readable equations, not black-box weights.

Download

TuringBot main interface showing equation discovery features

Turn your data into formulas that actually make sense


TuringBot uses Symbolic Regression to find the formula behind your data: a real equation you can read, audit, and put in a paper.

Black Box ML
[[0.23, -0.41, ...], [0.87, 0.12, ...], ...]
Impossible to interpret
TuringBot
y = 2.3x + sin(z)
Clear, interpretable formula

What can TuringBot be used for?

If you can frame it as y = f(x₁, x₂, …, xₙ), TuringBot can find the formula. Paste your data into the built-in spreadsheet or import a TXT/CSV file with any number of columns, then start the search.

To give a few concrete examples:

Note that the second example is a classification problem. This is not an issue: just find formulas that output 0 or 1 depending on the category.

TuringBot classification results graph showing model accuracy

A decision boundary found with symbolic regression. Tutorial

Why choose TuringBot?

  • Cited in 60+ academic publications: 30 in engineering, 17 in physical sciences, 10 in computer science. Also used by companies in oil & gas, aerospace, and manufacturing. See the publications list.
  • No model to choose: Unlike classical curve fitting, you do not have to pick the equation form in advance. The search finds the structure and the coefficients together.
  • One fast native binary: Pure C++ with a custom search algorithm, so it outpaces Python- and Julia-based alternatives. Nothing to set up: no Python, no Docker, no Conda, no virtual environments.
  • Configurable and scriptable: Define your own search options, including base functions, constants, error metrics, and formula templates. A full command-line interface and a Python library drop it into scripts and pipelines.
  • A working alternative to Eureqa: Eureqa was acquired by DataRobot and is no longer commercially available, while TuringBot has shipped updates since 2020. A 2020 paper found that TuringBot performs noticeably better than Eureqa on physics-inspired problems, including some it could not solve at all (arXiv:2010.11328).

Academic publications

High-strain rate compressive behavior of fiber-reinforced rubberized concrete

Lai, D., Demartino, C., & Xiao, Y. (2022). Construction and Building Materials, 319, 125739. [URL]

Novel machine-learning-based stall delay correction model for improving blade element momentum analysis in wind turbine performance prediction

Syed Ahmed Kabir, I. F., Gajendran, M. K., Ng, E., Mehdizadeh, A., & Berrouk, A. S. (2022). Wind, 2(4), 636–658. [URL]

Finite element analysis and machine learning guided design of carbon fiber organosheet-based battery enclosures for crashworthiness

Shaikh, S. A., Taufique, M. F. N., Balusu, K., Kulkarni, S. S., Hale, F., Oleson, J., Devanathan, R., & Soulami, A. (2024). Applied Composite Materials, 31(5), 1475–1493. [URL]

Effect of the refrigerant charge, expansion restriction, and compressor speed interactions on the energy performance of household refrigerators

Knabben, F. T., Ronzoni, A. F., & Hermes, C. J. (2021). International Journal of Refrigeration, 130, 347–355. [URL]

Machine learning-based approach to wind turbine wake prediction under yawed Conditions

Gajendran, M. K., Kabir, I. F. S. A., Vadivelu, S., & Ng, E. Y. K. (2023). Journal of Marine Science and Engineering, 11(11), 2111. [URL]

Evaluating the suitability of linear and nonlinear regression approaches for the Langmuir adsorption model as applied toward biomass-based adsorbents: Testing residuals and assessing model validity

Mikolajczyk, A. P., Fortela, D. L. B., Berry, J. C., Chirdon, W. M., Hernandez, R. A., Gang, D. D., & Zappi, M. E. (2024). Langmuir, 40(39), 20428–20442. [URL]

From kepler to newton: Explainable AI for science discovery

Li, Z., Ji, J., & Zhang, Y. (2021). arXiv preprint arXiv:2111.12210. [URL]

Continued fractions and the Thomson problem

Moscato, P., Haque, M. N., & Moscato, A. (2023). Scientific Reports, 13(1), 7272. [URL]

The SDSS-Gaia View of the Color–Magnitude Relation for Blue Horizontal-branch Stars

Barbosa, F. O., Santucci, R. M., Rossi, S., Limberg, G., Perez-Villegas, A., & Perottoni, H. D. (2022). The Astrophysical Journal, 940(1), 30. [URL]

New alternatives to the Lennard-Jones potential

Moscato, P. & Haque, M. N. (2024). Scientific Reports, 14(1), 11169. [URL]

Logic guided genetic algorithms (student abstract)

Ashok, D., Scott, J., Wetzel, S. J., Panju, M., & Ganesh, V. (2021). In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, No. 18, pp. 15753–15754). [URL]

Practical level-of-detail aggregation of fur appearance

Zhu, J., Zhao, S., Wang, L., Xu, Y., & Yan, L. (2022). ACM Transactions on Graphics (TOG), 41(4), 1–17. [URL]

An analytic BRDF for materials with spherical Lambertian scatterers

d'Eon, E. (2021). In Computer Graphics Forum (Vol. 40, No. 4, pp. 153–161). [URL]

Identifying influential nodes with centrality indices combinations using symbolic regressions

Mukhtar, M. F., Abas, Z. A., Rasib, A. H. A., Anuar, S. H. H., Zaki, N. H. M., Rahman, A. F. N. A., Abidin, Z. Z., & Shibghatullah, A. S. (2022). International Journal of Advanced Computer Science and Applications, 13(5). [URL]

VMF Diffuse: A unified rough diffuse BRDF

d'Eon, E. & Weidlich, A. (2024). In Computer Graphics Forum (Vol. 43, No. 4, pp. e15149). [URL]

A review of the fractal market hypothesis for trading and market price prediction

Blackledge, J. & Lamphiere, M. (2021). Mathematics, 10(1), 117. [URL]

Data-driven artificial intelligence (AI) algorithms for modelling potential maize yield under maize–legume farming systems in East Africa

Agboka, K. M., Tonnang, H. E., Abdel-Rahman, E. M., Odindi, J., Mutanga, O., & Niassy, S. (2022). Agronomy, 12(12), 3085. [URL]

New postoperative pain instrument for toddlers—Secondary analysis of prospectively collected assessments after tonsil surgery

Gude, P., Geldermann, N., Gustedt, F., Grobe, C., Weber, T., & Georgevici, A. (2024). Pediatric Anesthesia, 34(4), 347–353. [URL]

P37 Can Artificial Intelligence Methods Improve Mapping of Preference Based Measures? an Application of Symbolic Regression

Crott, R. (2023). Value in Health, 26(12), S10. [URL]

MSR223 A Comparison of of Symbolic Regression Machine Learning Methods for Mapping EQ-5D Utilities

Crott, R. (2024). Value in Health, 27(12), S482. [URL]

If you use TuringBot in your research, you can cite it as:

TuringBot Software (2020). TuringBot: Symbolic Regression Software [Computer software]. https://turingbotsoftware.com.

How does it work?

TuringBot implements a technique called Symbolic Regression. It tries to combine a set of base functions into simple formulas that accurately predict a target variable as a function of one or more input variables. The base functions offered by the program are the following:

  • Arithmetic: addition, multiplication, division
  • Trigonometric: sin, cos, tan, asin, acos, atan
  • Exponential: exp, log, log2, log10, sqrt, pow
  • Hyperbolic: sinh, cosh, tanh, asinh, acosh, atanh
  • Logical: smaller, greater, equal, different, min, max, logical_or, logical_and
  • History: delay, moving_average
  • Other: abs, floor, ceil, round, sign, fmod, tgamma, lgamma, erf

What is optimized is the formula itself, and not just the numerical constants of some assumed model. The search is driven by simulated annealing, not by the genetic programming that most other symbolic regression tools use.

You can choose from fifteen error metrics, for regression and for classification:

Regression

  • RMS error
  • Mean error
  • Percentile error
  • Maximum error
  • Mean relative error
  • Maximum relative error
  • Correlation coefficient
  • Hybrid (CC+RMS)
  • Nash-Sutcliffe efficiency
  • Residual sum of squares (RSS)
  • Root mean squared log error (RMSLE)

Classification

  • Classification accuracy
  • F-score
  • Binary cross-entropy
  • Matthews correlation coefficient

Here is an example input file you can try: input.txt.

Is TuringBot free?

Yes. TuringBot is free forever for small datasets, with no credit card and no signup. Download it, load your data, and see what it finds. For larger datasets and unlimited variables, paid licenses are on the Pricing page.

Find the Formula Behind Your Data

No signup required.