Assertion Contradicted AI assessment confidence: 95% certainty 4/5 debate potential 2/5

Brute-forcing a 10-word sentence requires one billion permutations

Sameer Maskey · Sameer Maskey, Fusemachines // Improving Customer Service (FirstMark / Data Driven NYC) · May 28, 2015 · at 3:04

Sameer Maskey, founder of Fusemachines and adjunct professor at Columbia University, explains computational language limits at Data Driven NYC.

0:00 / 0:06exact quote · 6.3s

▶ Watch the full episode on YouTube → 720p mp4 · rendered on demand · StarZero watermark

“For a machine to create a sentence out of 10 words, it has to go through one billion permutations.”

quote is from the automated transcript, cleaned for reading: filler sounds and stutters are removed, nothing is rephrased. names can be misheard (the analysis reads context, assessments check outside sources). how →

The claim, plainly

For a machine to generate a sentence out of 10 words using brute-force search, it must evaluate one billion permutations.

a quote alone can be ambiguous, so this restates it with the references and context of the conversation around it resolved. AI-written; the tape below the player is the source.

Assessment

The claim asserts that brute-force search over a 10-word sentence requires evaluating one billion permutations. Mathematically, the number of unique permutations of 10 distinct words without replacement is 10! = 3,628,800 (approx. 3.63 million), which is less than 0.4 percent of one billion. If interpreted instead as generating a 10-word sequence with replacement from a vocabulary of 10 words (10^10), the search space is 10 billion, off by a factor of 10. Because no standard combinatorial calculation for 10 words equals 1 billion, the statement is mathematically false.

The permutations of 10 distinct words is 10! = 3,628,800.
Selecting a 10-word sentence from a 10-word vocabulary with replacement yields 10^10 = 10,000,000,000 sequences.

Checked against

[1] calculatorsoup.com [2] calculator.net [3] quora.com [4] wordpress.com

permutations of 10 words factorial 10 3628800 OR 10^9

assessed as of 2026-07-30

This assessment is an AI reading of a public statement, made against the cited references with the confidence shown. It can be wrong. The quote, the tape and the references are all on this page; if something is off, use report an error below. full disclaimer →

Mentioned

machine language generation

⚑ Spot an error? Report it

More from Sameer Maskey

Insight

True data scientists need engineering, machine learning, and visualization mastery

“In order to really be a data scientist, you need to know engineering very well, so that you can process all forms of data. You need to know machine learning also very well, Which takes many, many years of training, and you also need to know, ah, all these user…”

Sameer Maskey May 28, 2015 ▶ 25:16 Sameer Maskey, Fusemachines // Improving Customer Service (FirstMark / Data Driven NYC)

Assertion Contradicted

42 billion customer service calls are made annually

“Forty-two billion calls come to call centers in a given year.”

Sameer Maskey May 28, 2015 ▶ 1:30 Sameer Maskey, Fusemachines // Improving Customer Service (FirstMark / Data Driven NYC)

Assertion Not publicly verifiable

Fusemachines deployed an AI customer service platform with NYC in 2014

“This is a system that New York City deployed. This is our system. They deployed it last year”

Sameer Maskey May 28, 2015 ▶ 6:36 Sameer Maskey, Fusemachines // Improving Customer Service (FirstMark / Data Driven NYC)

Assertion Not checkable as stated

In 2015, AI cannot hold fully automated conversations with humans

“We are not at the point where we have fully automated talking machines that can converse with humans as we do”

Sameer Maskey May 28, 2015 ▶ 19:22 Sameer Maskey, Fusemachines // Improving Customer Service (FirstMark / Data Driven NYC)

Brute-forcing a 10-word sentence requires one billion permutations

More from Sameer Maskey

Turn any episode into a week of clips.